.png){kind=icon}
.png){kind=icon}
Return
Sparse Multi-View K-Means Clustering
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2025.3551160.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In machine learning, k-means clustering is an unsupervised leaning technique to partition the data into k clusters that are homogeneous within the cluster and heterogeneous between clusters. The k-means algorithm assigns equal importance to all features in a single view. Several multi-view clustering techniques have been developed over the last few decades, including multi-view k-means (MVKM). In MVKM, patterns can be detected more accurately, and clustering performance is improved by applying each view individually for pattern discovery. The demand for highly accurate and flexible methods in machine learning and artificial intelligence has increased the use of multi-view datasets. These datasets are complicated and pose challenges for researchers in real-life situations. A novel type of sparse k-means clustering algorithm, sparse MVKM (S-MVKM), is proposed in this study for multi-view data. The main aim of our proposed S-MVKM algorithm is to achieve sparsity in features and shrink unimportant features to exactly zero using Lasso (least absolute shrinkage and selection operator). For considering theoretic behaviors of the S-MVKM algorithm, we create a convergence theorem to ensure that any convergent subsequence in S-MVKM will ultimately tend to an optimal solution. The proposed S-MVKM algorithm is then compared with several existing algorithms, such as traditional MVKM, feature reduction MVKM (FR-MVKM), MVKM with adaptive sparse membership weight allocation (M-VASM), and redundant and sparse feature learning (RSF-MVKM). Based on the three clustering performance measures of accuracy rate, Rand index, and normalized mutual information, we make the comparisons between them by using several synthetic and real-world datasets. The comparative results demonstrate that the proposed S-MVKM clustering algorithm effectively surpasses these competing clustering algorithms in terms of these three performance measures. Finally, we make concluding remarks that provide potential guidelines for future research in multi-view clustering area.
Keywords:
Clustering algorithms
Linear programming
Machine learning algorithms
Convergence
Accuracy
Data mining
Social networking (online)
Partitioning algorithms
Internet of Things
Industries
K-means
multi-view k-means (MVKM)
sparsity
sparse MVKM (S-MVKM)
feature reduction
performance measures