Skip to content

Data clustering

Anil K. Jain, Musti Narasimha Murty, Patrick J. Flynn

ACM Computing Surveys · 1999 · 13,951 citationsOpen access

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

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

In text: (Jain et al., 1999)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

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.

  1. Regression Shrinkage and Selection Via the Lasso1996
  2. Maximum Likelihood from Incomplete Data Via the EM Algorithm1977
  3. Latent dirichlet allocation2003
  4. A tutorial on hidden Markov models and selected applications in speech recognition1989
  5. Statistical Analysis With Missing Data1989

Metadata from OpenAlex (CC0). Citations are generated from the published record.