Data clustering: A review

10.5kCitations
Citations of this article
6.9kReaders
Mendeley users who have this article in their library.
Get full text

Abstract

Clustering is the unsupervised classification of patterns (observations, data items, or feature vectors) into groups (clusters). The clustering problem has been addressed in many contexts and by researchers in many disciplines; this reflects its broad appeal and usefulness as one of the steps in exploratory data analysis. However, clustering is a difficult problem combinatorially, and differences in assumptions and contexts in different communities has made the transfer of useful generic concepts and methodologies slow to occur. This paper presents an overview of pattern clustering methods from a statistical pattern recognition perspective, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners. We present a taxonomy of clustering techniques, and identify cross-cutting themes and recent advances. We also describe some important applications of clustering algorithms such as image segmentation, object recognition, and information retrieval. © 2000 ACM.

Cite

CITATION STYLE

APA

Jain, A. K., Murty, M. N., & Flynn, P. J. (1999). Data clustering: A review. In ACM Computing Surveys (Vol. 31, pp. 264–323). https://doi.org/10.1145/331499.331504

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free