DMCA
Constrained K-means Clustering with Background Knowledge (2001)
| Venue: | In ICML |
| Citations: | 473 - 9 self |
BibTeX
@INPROCEEDINGS{Wagstaff01constrainedk-means,
author = {Kiri Wagstaff and Claire Cardie and Seth Rogers and Stefan Schroedl},
title = {Constrained K-means Clustering with Background Knowledge},
booktitle = {In ICML},
year = {2001},
pages = {577--584},
publisher = {Morgan Kaufmann}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Clustering is traditionally viewed as an unsupervised method for data analysis. However, in some cases information about the problem domain is available in addition to the data instances themselves. In this paper, we demonstrate how the popular k-means clustering algorithm can be pro tably modi- ed to make use of this information. In experiments with arti cial constraints on six data sets, we observe improvements in clustering accuracy. We also apply this method to the real-world problem of automatically detecting road lanes from GPS data and observe dramatic increases in performance. 1.
