Semi-supervised Selective Clustering Ensemble based on constraint information.

Clustering is an important research direction in data mining. However, there is no one clustering algorithm that can be applied efficiently in all situation. Clustering ensemble is the best way to solve the above-mentioned problems. It combines the results of multiple clustering algorithms, and the final result is significantly better than a single clustering algorithm. Although there is a lot of constraint information, the existing clustering ensemble algorithm does not utilize it. This paper uses constraint information in consensus function and proposes a Semi-supervised Selective Clustering Ensemble based on Chameleon (SSCEC) and Semi-supervised Selective Clustering Ensemble based on Ncut (SSCEN) to solve the above problem. SSCEC uses the chameleon algorithm as consensus function, and processes constraint information in subgraph partition and subgraph combining. SSCEN uses the Normalized cut algorithm as consensus function, and processes constraint information in the process of graph dichotomy. The experiment results show that our proposed two semi-supervised member selection clustering ensemble algorithms are better than other semi-supervised algorithms. [ABSTRACT FROM AUTHOR]