k-means++: the advantages of careful seeding
David Arthur, Sergei Vassilvitskii
The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
What this paper cites, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| Least squares quantization in PCM | 1982 | 15,893 |
| A Survey of Clustering Data Mining Techniques | 2006 | 2,815 |
What cites it, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| GraRep | 2015 | 1,633 |
Links
Topics
| Advanced Clustering Algorithms Research | Computer Science |
| Data Management and Algorithms | Computer Science |
| Face and Expression Recognition | Computer Science |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports2 author record(s) attached.
- supports21 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 5cad55ac5d4d41e1…