摘要
In traditional spectral clustering algorithms, the number of cluster is choosen in advance. A self-adaption spectral clustering algorithm is proposed to decide the cluster number automatically, which eliminates the drawbacks of two kinds of spectral clustering methods. In our algorithm, eigengap is used to discover the clustering stability and decide the cluster number automatically. We prove theoretically the rationality of cluster number using matrix perturbation theory. A kernel based fuzzy c-means is introduced to spectral clustering algorithm to separate clusters. Finally the experiments prove that our algorithm tested in the UCI data sets may get better results than c-means, Ng et.al's algorithm and Francesco et.al's algorithm.
| 源语言 | 英语 |
|---|---|
| 主期刊名 | Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007 |
| 页 | 3965-3968 |
| 页数 | 4 |
| DOI | |
| 出版状态 | 已出版 - 2007 |
| 活动 | 6th International Conference on Machine Learning and Cybernetics, ICMLC 2007 - Hong Kong, 中国 期限: 19 8月 2007 → 22 8月 2007 |
出版系列
| 姓名 | Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007 |
|---|---|
| 卷 | 7 |
会议
| 会议 | 6th International Conference on Machine Learning and Cybernetics, ICMLC 2007 |
|---|---|
| 国家/地区 | 中国 |
| 市 | Hong Kong |
| 时期 | 19/08/07 → 22/08/07 |
指纹
探究 'A spectral clustering algorithm based on self-adaption' 的科研主题。它们共同构成独一无二的指纹。引用此
Li, K., & Liu, Y. S. (2007). A spectral clustering algorithm based on self-adaption. 在 Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007 (页码 3965-3968). 文章 4370839 (Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007; 卷 7). https://doi.org/10.1109/ICMLC.2007.4370839