A Probabilistic Approach to Latent Cluster Analysis
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 1813-1818.
Abstract
Facing a large number of clustering solutions, cluster ensemble method provides an effective approach to aggregating them into a better one. In this paper, we propose a novel cluster ensemble method from probabilistic perspective. It assumes that each clustering solution is generated from a latent cluster model, under the control of two probabilistic parameters. Thus, the cluster ensemble problem is reformulated into an optimization problem of maximum likelihood. An EM-style algorithm is designed to solve this problem. It can determine the number of clusters automatically. Experimental results have shown that the proposed algorithm outperforms the state-of-the-art methods including EAC-AL, CSPA, HGPA, and MCLA. Furthermore, it has been shown that our algorithm is stable in the predicted numbers of clusters.
@inproceedings{ijcai2013p268,
title = {A Probabilistic Approach to Latent Cluster Analysis},
author = {Xie, Zhipeng and Dong, Rui and Deng, Zhengheng and He, Zhenying and Yang, Weidong},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {1813--1818},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/268},
}
TY - CPAPER TI - A Probabilistic Approach to Latent Cluster Analysis AU - Xie, Zhipeng AU - Dong, Rui AU - Deng, Zhengheng AU - He, Zhenying AU - Yang, Weidong T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 1813 EP - 1818 UR - https://ijcai.org/proceedings/2013/268 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: