A local search approximation algorithm for k-means clustering
In k-means clustering we are given a set of n data points in d-dimensional space ℜd and an integer k, and the problem is to determine a set of k points in ℜd, called centers, to...
Publications
1 shownFrequent Co-Authors
Researcher Info
- h-index
- 1
- Publications
- 1
- Citations
- 497
- Institution
- University of Maryland, College Park
External Links
Impact Metrics
h-index
1
h-index: Number of publications with at least h citations each.