Consensus clustering has in recent years become one of the most popular topics in the clustering research, due to its promising ability in combining multiple weak base clusterings into a strong consensus result. In this paper, we aim to deal with three challenging issues in consensus clustering, i.e., the high-order integration issue, the local reliability issue, and the efficiency issue. Specifically, we present a new consensus clustering approach termed meta-cluster based consensus clustering with local weighting and random walking (MC3LR). To ensure the computational efficiency, we use the base clusters as the graph nodes to construct a cluster-wise similarity graph. Then, we perform random walks on the cluster-wise similarity graph to explore its high-order structural information, based on which a new cluster-wise similarity measure is derived. To tackle the local reliability issue, all of the base clusters are assessed and weighted according to the ensemble-driven cluster index (ECI). Finally, a locally weighted meta-clustering process is performed on the newly obtained cluster-wise similarity measure to build the consensus clustering result. Experimental results on multiple datasets have shown the effectiveness and efficiency of the proposed approach.
CITATION STYLE
He, N., & Huang, D. (2019). Meta-cluster Based Consensus Clustering with Local Weighting and Random Walking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11936 LNCS, pp. 266–277). Springer. https://doi.org/10.1007/978-3-030-36204-1_22
Mendeley helps you to discover research relevant for your work.