Abstract
In this paper we develop a new graph representation based on the path-weighted adjacency matrix for characterising global graph structure. The representation is derived from the heat-kernel of the graph. We investigate whether the path-weighted adjacency matrix can be used for the problem of graph partitioning. Here we demonstrate that the method out-performs the use of the adjacency matrix. The main advantage of the new method is that it both preserves partition consistency and shows improved stability to structural error.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bai, X., Hancock, E.R.: Heat kernels, manifolds and graph embedding. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004, vol. 3138, pp. 198–206. Springer, Heidelberg (2004)
Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. Advances in Neural Information Processing Systems, 585–591 (2002)
Chung, F.R.K., Yau, S.-T.: Coverings, heat kernels and spanning trees. The Electronic Journal of Combinatorics 6 (1999)
Chung, F.R.K.: Spectral Graph Theory. CBMS series, vol. 92. American Mathmatical Society Ed. (1997)
Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, Cambridge (2000)
Kondor, R., Lafferty, J.: Diffusion kernels on graphs and other discrete structures. In: 19th Intl. Conf. on Machine Learning (ICML) [ICM 2002] (2002)
Lodhi, H., Saunders, C., Shawe-Taylor, J., Cristianini, N., Watkins, C.: Text classification using string kernels. The Journal of Machine Learning Research 2, 419–444 (2002)
Luo, B., Cross, A.D., Hancock, E.R.: Corner detection via topographic analysis of vector potential. In: Proceedings of the 9th British Machine Vision Conference (1998)
Luo, B., Hancock, E.R.: Structural graph matching using the em algorithm and singular value decomposition. IEEE PAMI 23(10), 1120–1136 (2001)
Pavan, M., Pelillo, M.: Dominant sets and hierarchical clustering. In: ICCV, pp. 362–369 (2003)
Qiu, H., Hancock, E.R.: Graph partition for mathing. In: Graph Based Representations in Pattern Recognition (2003)
Qiu, H., Hancock, E.R.: Spectral simplification of graphs. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol. 3024, pp. 114–126. Springer, Heidelberg (2004)
Sch, B., Smola, A., Muller, K.: Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation 10, 1299–1319 (1998)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE PAMI 22(8), 888–905 (2000)
Simon, H.D.: Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering 2, 135–148 (1991)
Wilson, R.J., Watkins, J.J.: Graphs: an introductory approach: a first course in discrete mathematics, Wiley international edition. Wiley, New York (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qiu, H., Hancock, E.R. (2005). A Robust Graph Partition Method from the Path-Weighted Adjacency Matrix. In: Brun, L., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2005. Lecture Notes in Computer Science, vol 3434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31988-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-31988-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25270-2
Online ISBN: 978-3-540-31988-7
eBook Packages: Computer ScienceComputer Science (R0)