Abstract
Clustering is the process of grouping together objects that are similar. The groups formed by clustering are referred to as clusters
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
References
A.K. Jain, M.N. Murty, P.J. Flynn, Data clustering: a review. ACM Comput. Surv. 31, 264–323 (1999)
T. Kurita, An efficient agglomerative clustering algorithm using a heap. Pattern Recogn. 24, 205–209 (1991)
P. Berkhin, J. Becher, Learning simple relations: theory and applications. ed. by R.L. Grossman, J. Han, V. Kumar, H. Mannila, R. Motwani, in Proceedings of the 2nd SIAM International Conference on Data Mining, (Arlington, 2002), pp. 420–436
L. Kaufman, P.J. Rousseeuw, Finding Groups in Data—An Introduction to Cluster Analysis (Wiley Interscience, New York, 1990)
M. Fiedler, Algebraic connectivity of graphs. Czechoslovak Math. J. 23, 298–305 (1973)
B. Nadler, M. Galun, Fundamental limitation of spectral clustering, Advances in Neural Information Processing Systems, vol 19 (MIT Press, Cambridge, 2007), pp. 1017–1024
L. Hagen, A. Kahng, New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Comput. Aided Des. 11, 1074–1085 (1992)
J. Shi, J. Malik, Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22, 888–905 (2000)
P. Perona, W. Freeman, A factorization approach to grouping. In European Conference on Computer Vision (1998), pp. 655–670
M. Steinbach, G. Karypis, V. Kumar. A comparison of document clustering techniques. ed. by M. Grobelnik, D. Mladenic, N. Milic-Freyling. KDD Workshop on Text Mining, (Boston, 2000)
S. Ray, R. Turi, Determination of number of clusters in \(k\)-means clustering in colour image segmentation. In Proceedings of the 4th International Conference on Advances in Pattern Recognition and Digital Technology, (Narosa, New Delhi, 1984), pp. 137–143
U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikolski, D. Wagner, On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172–188 (2008)
P.N. Tan, M. Steinbach, V. Kumar, Introduction to Data Mining (Addison-Wesley, Reading, 2005)
A.K. Jain, R.C. Dubes, Algorithm for Clustering Data (Prentice Hall, Englewood Cliffs, 1988)
P. Berkhin, A survey of clustering data mining techniques, in Grouping Multidimensional Data—Recent Advances in Clustering, ed. by J. Kogan, C. Nicholas, M. Teboulle(Springer, Berlin, 2006), pp. 25–72
T. Zhang, R. Ramakrishnan, M. Livny, Birch: a new data clustering algorithm and its applications. Data Min. Knowl. Disc. 1(2), 141–182 (1997)
M. Fiedler, A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czechoslovak Math. J. 25, 619–633 (1975)
J. Kleinberg, An impossibility theorem for clustering, in Advances in Neural Information Processing Systems, 15, Vancouver, Canada, 2002, ed. by S. Becker, S. Thrun, K. Obermayer. (MIT Press, Cambridge, 2003), pp. 446–453
W.E. Donath, A.J. Hoffman, Lower bounds for the partitioning of graphs. IBM J. Res. Dev. 17, 420–425 (1973)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer-Verlag London
About this chapter
Cite this chapter
Simovici, D.A., Djeraba, C. (2014). Clustering. In: Mathematical Tools for Data Mining. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/978-1-4471-6407-4_16
Download citation
DOI: https://doi.org/10.1007/978-1-4471-6407-4_16
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-6406-7
Online ISBN: 978-1-4471-6407-4
eBook Packages: Computer ScienceComputer Science (R0)