Who Cited It

k-means++: the advantages of careful seeding

2007 · 6,301 citations · 1 from inside this corpus

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.

k-means++: the advantages of careful seeding (2007)k-means++: the advantages of …Least squares quantization in PCM (1982)Least squares quantization in…A Survey of Clustering Data Mining Techniques (2006)A Survey of Clustering Data M…GraRep (2015)GraRep
3 of 3 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.
this paper works it cites works citing it node size = global citations · hover for the full title

What this paper cites, inside the corpus

PaperYearCited
Least squares quantization in PCM198215,893
A Survey of Clustering Data Mining Techniques20062,815

What cites it, inside the corpus

PaperYearCited
GraRep20151,633

Links

DOI · OpenAlex record

Topics

Advanced Clustering Algorithms ResearchComputer Science
Data Management and AlgorithmsComputer Science
Face and Expression RecognitionComputer 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

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:43+00:00.

sha256 5cad55ac5d4d41e1…