Initialization-similarity clustering algorithm

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.

Description

CAUL read and publish agreement 2022

Keywords

k-means clustering, Spectral clustering, Initialization, Similarity

Citation

MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (23), pp. 33279 - 33296

URI

https://hdl.handle.net/10179/17430

Collections

Journal Articles

Full item page