Synonyms
Graph-based clustering
Definition
Let X be a set X = {x1, x2,…,xN} of N data points. An m-clustering of X, is defined as the partition of X into m sets (clusters), C1,…,Cm, so that the following three conditions are met:
Ci ≠ Ø, i = 1,…,m
∪i=1m Ci = X
Ci ∩ Cj = Ø, i ≠ j, i, j = 1,…,m
In addition, the data points contained in a cluster Ci are “more similar” to each other and “less similar” to the points of the other clusters. The terms “similar” and “dissimilar” depend very much on the types of clusters the user expects to recover from X. A clustering defined as above is known as hard clustering, to distinguish it from the fuzzy clustering case.
Historical Background
The essence of clustering is to “reveal” the organization of patterns into “sensible” groups. It has been used as a critical analysis tool in a vast range of disciplines, such as medicine, social sciences, engineering, computer science, machine learning, bioinformatics, data mining and information retrieval. The...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Belikn M, Niyogi P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 2003;15(6):1373–96.
Chan P, Schlag M, Zien J. Spectral k-way ratio cut partitioning. IEEE Trans Comput Aided Des Integrated Circ Syst. 1994;13(9):1088–96.
Chung FRK. Spectral graph theory. American Mathematical Society; 1997.
Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslov Math J. 1975;25(100):619–33.
Golub GH, Van Loan CF. Matrix somputations. Baltimore: John Hopkins; 1989.
Hagen LW, Kahng AB. New spectral methods for ratio cut partitioning and clustering. IEEE Trans Comput Aided Des Integrated Circ Syst. 1992;11(9):1074–85.
Hendrickson B, Leland R. Multidimensional spectral load balancing. In: Proceedings of the 4th SIAM Conference on Parallel Processing; 1993. p. 953–61.
Kannan R, Vempala S, Vetta A. On clusterings- good, bad and spectral. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science; 2000. p. 367–77.
Ling RF. On the theory and construction of k-clusters. Comput J. 1972;15(4):326–32.
Ng AY, Jordan M, Weiis Y. On spectral clustering analysis and an algorithm. In: Proceedings of the 14th Conference on Advances in Neural Information Processing Systems; 2001.
Qiu H, Hancock ER. Clustering and embedding using commute times. IEEE Trans Pattern Anal Mach Intell. 2007;29(11):1873–90.
Scott G, Longuet-Higgins H. Feature grouping by relocalization of eigenvectors of the proximity matrix. In: Proceedings of the British Machine Vision Conference; 1990. p. 103–8.
Shi J, Malik J. Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell. 2000;22(8):888–905.
Theodoridis S, Koutroumbas K. Pattern recognition. 4th edn. Academic Press; 2008.
Verma D, Meilă M. A comparison of spectral clustering algorithms. Technical Report, UW-CSE-03-05-01. Seattle: CSE Department/University of Washington; 2003.
Wu Z, Leahy R. An optimal graph theoretic approach to data clustering: theory and its applications to image segmentation. IEEE Trans Pattern Anal Mach Intell. 1993;15(11):1101–13.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Theodoridis, S., Koutroumbas, K. (2018). Spectral Clustering. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_606
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_606
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering