Mining More Inter-Cluster Association Information to Improve Ensemble Clustering

Ensemble clustering has gained increasing attention for its critical role in data analysis. Recent studies emphasize the importance of mining inter-cluster relationships instead of relying solely on pairwise similarities. However, existing methods often fail to fully exploit the global structure of inter-cluster association graphs, limiting their effectiveness. To address this, we propose a Deep Walk-based method to mine and utilize inter-cluster association information more effectively. By learning embeddings of cluster nodes, the approach captures multi-scale and global inter-cluster relationships, which are then incorporated into the co-association matrix to enhance clustering performance. Furthermore, we introduce an adaptive linkage selection strategy for hierarchical clustering as the consensus function. Unlike existing methods with fixed linkage modes, our approach leverages the inter-cluster association graph to adaptively select the most suitable linkage strategy, improving adaptability across diverse datasets. Experimental results on multiple datasets demonstrate that the proposed algorithm achieves superior performance and robustness, validating its effectiveness in ensemble clustering.

Authors

Institutions

Publication Details

Published
2025-03-21
DOI
https://doi.org/10.1109/csecs64665.2025.11009898
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Mining More Inter-Cluster Association Information to Improve Ensemble Clustering

Ruihan Li, Fusheng Yu
Advanced Clustering Algorithms Research
article

Mining More Inter-Cluster Association Information to Improve Ensemble Clustering

Ruihan Li, Fusheng Yu
article en

Abstract

Ensemble clustering has gained increasing attention for its critical role in data analysis. Recent studies emphasize the importance of mining inter-cluster relationships instead of relying solely on pairwise similarities. However, existing methods often fail to fully exploit the global structure of inter-cluster association graphs, limiting their effectiveness. To address this, we propose a Deep Walk-based method to mine and utilize inter-cluster association information more effectively. By learning embeddings of cluster nodes, the approach captures multi-scale and global inter-cluster relationships, which are then incorporated into the co-association matrix to enhance clustering performance. Furthermore, we introduce an adaptive linkage selection strategy for hierarchical clustering as the consensus function. Unlike existing methods with fixed linkage modes, our approach leverages the inter-cluster association graph to adaptively select the most suitable linkage strategy, improving adaptability across diverse datasets. Experimental results on multiple datasets demonstrate that the proposed algorithm achieves superior performance and robustness, validating its effectiveness in ensemble clustering.

Beijing Normal University (CN)
Openalex Percentile: Top 94%
Advanced Clustering Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.