k-HyperEdge Medoids for Clustering Ensemble

TL;DR

This paper introduces a novel clustering ensemble method based on k-HyperEdge Medoids, combining efficiency and robustness by leveraging hyperedge selection and diffusing from clustering and sample views, validated through experiments.

Contribution

It formulates clustering ensemble as a k-HyperEdge Medoids discovery problem and proposes an effective, theoretically sound method that balances efficiency and robustness.

Findings

The method approximates the optimal solution effectively.

It converges reliably across multiple datasets.

It outperforms nine benchmark algorithms in efficiency and effectiveness.

Abstract

Clustering ensemble has been a popular research topic in data science due to its ability to improve the robustness of the single clustering method. Many clustering ensemble methods have been proposed, most of which can be categorized into clustering-view and sample-view methods. The clustering-view method is generally efficient, but it could be affected by the unreliability that existed in base clustering results. The sample-view method shows good performance, while the construction of the pairwise sample relation is time-consuming. In this paper, the clustering ensemble is formulated as a k-HyperEdge Medoids discovery problem and a clustering ensemble method based on k-HyperEdge Medoids that considers the characteristics of the above two types of clustering ensemble methods is proposed. In the method, a set of hyperedges is selected from the clustering view efficiently, then the hyperedges are diffused and adjusted from the sample view guided by a hyperedge loss function to construct an effective k-HyperEdge Medoid set. The loss function is mainly reduced by assigning samples to the hyperedge with the highest degree of belonging. Theoretical analyses show that the solution can approximate the optimal, the assignment method can gradually reduce the loss function, and the estimation of the belonging degree is statistically reasonable. Experiments on artificial data show the working mechanism of the proposed method. The convergence of the method is verified by experimental analysis of twenty data sets. The effectiveness and efficiency of the proposed method are also verified on these data, with nine representative clustering ensemble algorithms as reference.