Search Results for author:
Found 15 papers, 0 papers with code
Deep Fair Multi-View Clustering with Attention KAN
Multi-view clustering is effective in unsupervised multi-view data analysis and has received considerable attention.
Attribute-Missing Multi-view Graph Clustering
Although some methods have been proposed to address the issue of missing node attributes, they come with the following limitations: i) Existing methods are often not tailored specifically for clustering tasks and struggle to address missing attributes effectively.
Self-Supervised Graph Embedding Clustering
However, it combines the K-means clustering and dimensionality reduction processes for optimization, leading to limitations in the clustering effect due to the introduced hyperparameters and the initialization of clustering centers.
High-Discriminative Attribute Feature Learning for Generalized Zero-Shot Learning
However, current attention-based models may overlook the transferability of visual features and the distinctiveness of attribute localization when learning regional features in images.
Fuzzy K-Means Clustering without Cluster Centroids
Fuzzy K-Means clustering is a critical technique in unsupervised data analysis.
Interpretable Multi-View Clustering Based on Anchor Graph Tensor Factorization
Nevertheless, existing multi-view clustering methods based on anchor graph factorization lack adequate cluster interpretability for the decomposed matrix and often overlook the inter-view information.
One-Step Multi-View Clustering Based on Transition Probability
Despite their successes, current methods lack interpretability in the clustering process and do not sufficiently consider the complementary information across different views.
Label Learning Method Based on Tensor Projection
Multi-view clustering method based on anchor graph has been widely concerned due to its high efficiency and effectiveness.
Anchor-free Clustering based on Anchor Graph Factorization
Additionally, we evolve the concept of the membership matrix between cluster centers and samples in FKM into an anchor graph encompassing multiple anchor points and samples.
Rethinking k-means from manifold learning perspective
Although numerous clustering algorithms have been developed, many existing methods still leverage k-means technique to detect clusters of data points.
Multi-View Clustering via Semi-non-negative Tensor Factorization
Multi-view clustering (MVC) based on non-negative matrix factorization (NMF) and its variants have received a huge amount of attention in recent years due to their advantages in clustering interpretability.
Self-supervised Contrastive Attributed Graph Clustering
Thus, for the OOS nodes, SCAGC can directly calculate their clustering labels.
Effective and Efficient Graph Learning for Multi-view Clustering
Despite the impressive clustering performance and efficiency in characterizing both the relationship between data and cluster structure, existing graph-based multi-view clustering methods still have the following drawbacks.
Multiple Graph Learning for Scalable Multi-view Clustering
Specifically, we construct a hidden and tractable large graph by anchor graph for each view and well exploit complementary information embedded in anchor graphs of different views by tensor Schatten p-norm regularizer.
Generative Partial Multi-View Clustering
Nowadays, with the rapid development of data collection sources and feature extraction methods, multi-view data are getting easy to obtain and have received increasing research attention in recent years, among which, multi-view clustering (MVC) forms a mainstream research direction and is widely used in data analysis.
