Alternatives to the k-means algorithm that find better clusterings.
| Anthology ID: | DBLP:conf/cikm/HamerlyE02 |
|---|---|
| Volume: | Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, McLean, VA, USA, November 4-9, 2002 |
| Year: | 2002 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 600-607 |
| URL: | https://doi.org/10.1145/584792.584890 |
| DOI: | https://doi.org/10.1145/584792.584890 |
| DBLP: | conf/cikm/HamerlyE02 |
| BibTeX: |
@inproceedings{hamerly-2002-alternatives,
author = {Greg Hamerly and
Charles Elkan},
title = {{Alternatives to the k-means algorithm that find better clusterings}},
booktitle = {{Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, McLean, VA, USA, November 4-9, 2002}},
pages = {600--607},
publisher = {ACM},
year = {2002},
url = {https://doi.org/10.1145/584792.584890},
doi = {https://doi.org/10.1145/584792.584890}
}