.png){kind=icon}
返回
Initialization-similarity clustering algorithm
.png){kind=icon}
OA
AI
DOI：10.1007/s11042-019-7663-8.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Classic k-means clustering algorithm randomly selects centroids for initialization to possibly output unstable clustering results. Moreover, random initialization makes the clustering result hard to reproduce. Spectral clustering algorithm is a two-step strategy, which first generates a similarity matrix and then conducts eigenvalue decomposition on the Laplacian matrix of the similarity matrix to obtain the spectral representation. However, the goal of the first step in the spectral clustering algorithm does not guarantee the best clustering result. To address the above issues, this paper proposes an Initialization-Similarity (IS) algorithm which learns the similarity matrix and the new representation in a unified way and fixes initialization using the sum-of-norms regularization to make the clustering more robust. The experimental results on ten real-world benchmark datasets demonstrate that our IS clustering algorithm outperforms the comparison clustering algorithms in terms of three evaluation metrics for clustering algorithm including accuracy (ACC), normalized mutual information (NMI), and Purity.
Keyword:
k-means clustering
Spectral clustering
Initialization
Similarity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
2.0W
被引数:
3.2W
机构
引用论文
.png){kind=icon}
分享收藏Joint Learning of Spectral Clustering Structure and Fuzzy Similarity Matrix of Data数据的谱聚类结构与模糊相似矩阵的联合学习
PREAI
分享收藏The changing epidemiology of paediatric brain tumours: a review from the Hospital for Sick Children
PREAI
分享收藏
查看更多内容