Spectral Clustering with Inconsistent Advice
Abstract
Clustering with advice (often known as constrained clustering) has been a recent focus of the data mining community. Success has been achieved incorporating advice into the k-means framework, as well as spectral clustering. Although the theory community has explored inconsistent advice, it has not yet been incorporated into spectral clustering. Extending work of De Bie and Cristianini, we set out a framework for finding minimum normalized cuts, subject to inconsistent advice. Our results suggest that the framework will be successful in many situations.
Cite
Text
Coleman et al. "Spectral Clustering with Inconsistent Advice." International Conference on Machine Learning, 2008. doi:10.1145/1390156.1390176Markdown
[Coleman et al. "Spectral Clustering with Inconsistent Advice." International Conference on Machine Learning, 2008.](https://mlanthology.org/icml/2008/coleman2008icml-spectral/) doi:10.1145/1390156.1390176BibTeX
@inproceedings{coleman2008icml-spectral,
title = {{Spectral Clustering with Inconsistent Advice}},
author = {Coleman, Tom and Saunderson, James and Wirth, Anthony},
booktitle = {International Conference on Machine Learning},
year = {2008},
pages = {152-159},
doi = {10.1145/1390156.1390176},
url = {https://mlanthology.org/icml/2008/coleman2008icml-spectral/}
}