Efficient Multiclass Maximum Margin Clustering
Abstract
This paper presents a cutting plane algorithm for multiclass maximum margin clustering (MMC). The proposed algorithm constructs a nested sequence of successively tighter relaxations of the original MMC problem, and each optimization problem in this sequence could be efficiently solved using the constrained concave-convex procedure (CCCP). Experimental evaluations on several real world datasets show that our algorithm converges much faster than existing MMC methods with guaranteed accuracy, and can thus handle much larger datasets efficiently.
Cite
Text
Zhao et al. "Efficient Multiclass Maximum Margin Clustering." International Conference on Machine Learning, 2008. doi:10.1145/1390156.1390313Markdown
[Zhao et al. "Efficient Multiclass Maximum Margin Clustering." International Conference on Machine Learning, 2008.](https://mlanthology.org/icml/2008/zhao2008icml-efficient/) doi:10.1145/1390156.1390313BibTeX
@inproceedings{zhao2008icml-efficient,
title = {{Efficient Multiclass Maximum Margin Clustering}},
author = {Zhao, Bin and Wang, Fei and Zhang, Changshui},
booktitle = {International Conference on Machine Learning},
year = {2008},
pages = {1248-1255},
doi = {10.1145/1390156.1390313},
url = {https://mlanthology.org/icml/2008/zhao2008icml-efficient/}
}