GBK-means clustering algorithm: An improvement to the K-means algorithm based on the bargaining game
Due to its simplicity, versatility and the diversity of applications to which it can be applied, k-
means is one of the well-known algorithms for clustering data. The foundation of this …
means is one of the well-known algorithms for clustering data. The foundation of this …
Comprehensive multi-view representation learning
Abstract Recently, Multi-view Representation Learning (MRL) has drawn immense
attentions in the analysis of multi-source data and ubiquitously employed across different …
attentions in the analysis of multi-source data and ubiquitously employed across different …
Breaking down multi-view clustering: a comprehensive review of multi-view approaches for complex data structures
Abstract Multi-View Clustering (MVC) is an emerging research area aiming to cluster
multiple views of the same data, which has recently drawn substantial attention. Various …
multiple views of the same data, which has recently drawn substantial attention. Various …
Collaborative annealing power k-means++ clustering
Clustering is the most fundamental technique for data processing. This paper presents a
collaborative annealing power k-means++ clustering algorithm by integrating the k-means++ …
collaborative annealing power k-means++ clustering algorithm by integrating the k-means++ …
Generalized label enhancement with sample correlations
Recently, label distribution learning (LDL) has drawn much attention in machine learning,
where LDL model is learned from labelel instances. Different from single-label and multi …
where LDL model is learned from labelel instances. Different from single-label and multi …
Auto-attention mechanism for multi-view deep embedding clustering
In several fields, deep learning has achieved tremendous success. Multi-view learning is a
workable method for handling data from several sources. For clustering multi-view data …
workable method for handling data from several sources. For clustering multi-view data …
Double-level view-correlation multi-view subspace clustering
In recent years, significant progress has been made in Multi-view Subspace Clustering
(MSC). Most existing MSC methods attempt to explore and exploit the view correlations of …
(MSC). Most existing MSC methods attempt to explore and exploit the view correlations of …
O-minus decomposition for multi-view tensor subspace clustering
With the powerful ability to exploit the latent structure of self-representation information,
multiple off-the-shelf low rank tensor constraints have been employed in multiview tensor …
multiple off-the-shelf low rank tensor constraints have been employed in multiview tensor …
Clean affinity matrix learning with rank equality constraint for multi-view subspace clustering
J Zhao, GF Lu - Pattern Recognition, 2023 - Elsevier
The existing multi-view subspace clustering (MVSC) algorithm still has certain limitations.
First, the affinity matrix obtained by them is not clean and robust enough since the original …
First, the affinity matrix obtained by them is not clean and robust enough since the original …
Multi-view adjacency-constrained hierarchical clustering
This paper explores the problem of multi-view clustering, which aims to promote clustering
performance with multi-view data. The majority of existing methods have problems with …
performance with multi-view data. The majority of existing methods have problems with …