Abstract
This paper investigates whether vectors of graph-spectral features can be used for the purposes of graph-clustering. We commence from the eigenvalues and eigenvectors of the adjacency matrix. Each of the leading eigenmodes represents a cluster of nodes and is mapped to a component of a feature vector. The spectral features used as components of the vectors are the eigenvalues, the cluster volume, the cluster perimeter, the cluster Cheeger constant, the inter-cluster edge distance, and the shared perimeter length. We explore whether these vectors can be used for the purposes of graph-clustering. Here we investigate the use of both central and pairwise clustering methods. On a data-base of view-graphs, the vectors of eigenvalues and shared perimeter lengths provide the best clusters.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
H. Bunke. Error correcting graph matching: On the influence of the underlying cost function. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21:917–922, 1999.
F. R. K. Chung. Spectral Graph Theory. American Mathmatical Society Ed., CBMS series 92, 1997.
Chatfield C. and Collins A. J. Introduction to multivariate analysis. Chapman & Hall, 1980.
R. Englert and R. Glantz. Towards the clustering of graphs. In 2nd IAPR-TC-15 Workshop on Graph-Based Representation, 1999.
Kruskal J. B. Nonmetric multidimensional scaling: A numerical method. Psychometrika, 29:115–129, 1964.
Gower J. C. Some distance properties of latent root and vector methods used in multivariate analysis. Biometrika, 53:325–328, 1966.
B. Luo, A. Robles-Kelly, A. Torsello, R. C. Wilson, and E. R. Hancock. Clustering shock trees. In Proceedings of GbR, pages 217–228, 2001.
H. Murase and S. K. Nayar. Illumination planning for object recognition using parametric eigenspaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(12):1219–1227, 1994.
S. Rizzi. Genetic operators for hierarchical graph clustering. Pattern Recognition Letters, 19:1293–1300, 1998.
J. Segen. Learning graph models of shape. In Proceedings of the Fifth International Conference on Machine Learning, pages 25–29, 1988.
K. Sengupta and K. L. Boyer. Organizing large structural modelbases. PAMI, 17(4):321–332, April 1995.
Torgerson W. S. Multidimensional scaling. i. theory and method. Psychometrika, 17:401–419, 1952.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luo, B., Wilson, R.C., Hancock, E.R. (2002). Spectral Feature Vectors for Graph Clustering. In: Caelli, T., Amin, A., Duin, R.P.W., de Ridder, D., Kamel, M. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2002. Lecture Notes in Computer Science, vol 2396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-70659-3_8
Download citation
DOI: https://doi.org/10.1007/3-540-70659-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44011-6
Online ISBN: 978-3-540-70659-5
eBook Packages: Springer Book Archive