Keywords
Cluster analysisComputer scienceAlgorithmArtificial intelligence
Related Publications
Unsupervised K-Means Clustering Algorithm
The k-means algorithm is generally the most known and used clustering method. There are various extensions of k-means to be proposed in the literature. Although it is an unsuper...
On clusterings
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is sh...
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in continge...
k-means++: the advantages of careful seeding
The k-means method is a widely used clustering technique that seeks to minimize the average squared distance between points in the same cluster. Although it offers no accuracy g...
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Publication Info
- Year
- 1976
- Type
- article
- Volume
- 71
- Issue
- 356
- Pages
- 1000-1000
- Citations
- 2601
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2601
OpenAlex
Cite This
A. D. Gordon,
J. A. Hartigan
(1976).
Clustering Algorithms..
Journal of the American Statistical Association
, 71
(356)
, 1000-1000.
https://doi.org/10.2307/2286880
Identifiers
- DOI
- 10.2307/2286880