Finding Groups in Data
Leonard Kaufman low, Peter J. Rousseeuw
No abstract in the source record.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
What cites it, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| Clustering by fast search and find of density peaks | 2014 | 5,040 |
| Model-Based Clustering, Discriminant Analysis, and Density Estimation | 2002 | 4,342 |
| BIRCH | 1996 | 3,918 |
| Multivariate Data Analysis | 2020 | 3,191 |
| Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values | 1998 | 2,509 |
| Unsupervised K-Means Clustering Algorithm | 2020 | 2,240 |
| BIRCH | 1996 | 2,075 |
| A Comprehensive Survey of Clustering Algorithms | 2015 | 1,939 |
| A Framework for Clustering Evolving Data Streams | 2003 | 1,802 |
Links
Topics
| Bayesian Modeling and Causal Inference | Computer Science |
| Data Mining Algorithms and Applications | Computer Science |
| Data Management and Algorithms | Computer Science |
Is this record sound?
partial
One field of this record is missing or disagrees with another. What is shown below is what the source publishes.
- supports2 author record(s) attached.
- weakensNo references are recorded despite 7,270 citations. A paper this heavily cited did not cite nothing, so the record is incomplete.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 5cad55ac5d4d41e1…