.png){kind=icon}
.png){kind=icon}
Return
Clustering Ensemble via Diffusion on Adaptive Multiplex
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2023.3311409.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Existing clustering ensemble methods often directly integrate multiple weak base results to obtain a consensus one which can improve the clustering performance. However, since the base results are weak and the clustering ensemble can improve the performance, why not refine the weak base results via the clustering ensemble, and then boost the clustering ensemble with the refined base results? To fulfill this idea, in this article, we propose a novel clustering ensemble method with an adaptive multiplex. We first use the multiplex to represent the multiple weak base results. Then, we learn an updated representation by diffusing the representation on the multiplex with a manifold ranking model. Since the multiplex characterizes the structure information of all base results, the learned representation can ensemble such structure information during diffusion. Next, the multiplex is refined by such representation, which is a process of refining base results via ensemble. We iteratively learn the representation (i.e., do ensemble) and update the multiplex (i.e., do refinement), which can make the ensemble and refinement be boosted by each other. At last, the final consensus result is obtained from the refined multiplex. The extensive experiments demonstrate the effectiveness and superiority of the proposed framework.
Keywords:
Clustering ensemble
multiplex
multiplex diffusion
Journal
IF:
10.4
Papers:
6.7K
Citations:
3.2W