k-means++¶
Arthur, D., & Vassilvitskii, S. (2007). k-means++: The Advantages of Careful Seeding. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1027-1035.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Local Optimum
- The prime's escape analysis is borne out by the standard remedy: because the trapped competence cannot escape by more of the same descent, practitioners use a different kind of move — random restarts (k-means++ seeding samples diverse starting basins), which covers more basins, exactly the prime's "diversity in search" inference.
This sourceSeeding that samples diverse starting basins to escape initialization-dependent local optima.
- The prime's escape analysis is borne out by the standard remedy: because the trapped competence cannot escape by more of the same descent, practitioners use a different kind of move — random restarts (k-means++ seeding samples diverse starting basins), which covers more basins, exactly the prime's "diversity in search" inference.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:ea9fa9fecdd6 · see in the full table