An Ensemble Clustering Approach (Consensus Clustering) for High-Dimensional Data

Abstract

Due to the plurality of irrelevant attributes, sparse distribution, and complicated calculations in high-dimensional data, traditional clustering algorithms, such as K-means, do not perform well on high-dimensional data. To address the clustering problem of high-dimensional data, this paper studies an integrated clustering method for high-dimensional data. A method of subspace division based on minimum redundancy is proposed to solve the problem of subspace division of high-dimensional data; subspace division is improved by using the K-means algorithm. Additionally, this method uses mutual information between the characteristic variables of the data to replace the calculation in the K-means algorithm. The distance between the characteristic variables of the data is used to divide the data into subspaces according to the mutual information values between the characteristic variables of the data. To achieve high clustering accuracy and diversity based on clustering requirements, this paper uses a genetic algorithm as the consistency integration function. The fitness function is designed according to the clustering fusion target, and the selection operator is designed according to the maximum number of overlapping elements in the base clustering. The experimental results show that the clustering algorithm proposed in this paper outperforms other methods on most datasets and is an effective clustering integration algorithm. The proposed clustering algorithm is compared with other commonly used clustering fusion algorithms on datasets to prove the advantages of the proposed algorithm.

Cauchy hyper-graph Laplacian nonnegative matrix factorization for single-cell RNA-sequencing data analysis

“…The superior performance of the CHLNMF model indicates the effectiveness of new techniques such as hypergraph regularization and the Cauchy loss function. This is in line with the goals of previous research [ 51 ], efforts aimed at improving the precision and reliability of clustering in single-cell transcriptome analysis. Given the challenges of working with complex and noisy single-cell datasets, our driven model contributes to ongoing efforts to develop advanced computational methods for analyzing scRNA-seq data.…”

A Survey of Ensemble Learning: Concepts, Algorithms, Applications, and Prospects

“…It aims to fuse two or more clustering models to obtain a superior performance compared to the single models [187]- [189]. Even though there are a few studies on ensemble clustering [190], more still needs to be done for it to become an established study area. Therefore, ensemble clustering is a recommended future research direction.…”

Consensus Big Data Clustering for Bayesian Mixture Models

“…Recent advancements in ensemble clustering have addressed various challenges posed by high-dimensional data and complex structures. Yan and Liu [23] proposed a consensus clustering approach specifically designed for high-dimensional data, while Niu et al [24] developed a multi-view ensemble clustering approach using a joint affinity matrix to improve the quality of clustering. Huang et al [25] introduced an ensemble hierarchical clustering algorithm that considers merits at both cluster and partition levels.…”