Journal Article10.1109/TNNLS.2021.3097748
Deep Multiview Collaborative Clustering.
44
TL;DR: Zhang et al. as mentioned in this paper proposed an end-to-end deep multiview clustering model with collaborative learning to predict the clustering results directly. But, their method is not suitable for multi-view data.
read more
Abstract: The clustering methods have absorbed even-increasing attention in machine learning and computer vision communities in recent years. In this article, we focus on the real-world applications where a sample can be represented by multiple views. Traditional methods learn a common latent space for multiview samples without considering the diversity of multiview representations and use K-means to obtain the final results, which are time and space consuming. On the contrary, we propose a novel end-to-end deep multiview clustering model with collaborative learning to predict the clustering results directly. Specifically, multiple autoencoder networks are utilized to embed multi-view data into various latent spaces and a heterogeneous graph learning module is employed to fuse the latent representations adaptively, which can learn specific weights for different views of each sample. In addition, intraview collaborative learning is framed to optimize each single-view clustering task and provide more discriminative latent representations. Simultaneously, interview collaborative learning is employed to obtain complementary information and promote consistent cluster structure for a better clustering solution. Experimental results on several datasets show that our method significantly outperforms several state-of-the-art clustering approaches.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Representation Learning in Multi-view Clustering: A Literature Review
Man-Sheng Chen,Jia-Qi Lin,Xiang-Long Li,Bao-Yu Liu,Chang-Dong Wang,Dong Huang,Jian-Huang Lai +6 more
TL;DR: In this article , a comprehensive survey of multi-view clustering from the perspective of representation learning is presented, including deep learning-based methods, and a taxonomy of the MVC algorithms is provided.
Refining Graph Structure for Incomplete Multi-View Clustering
TL;DR: GSRIMC as discussed by the authors extracts basic information from the precomputed subgraph of each view and then separates refined graph structure from biased error with the help of tensor nuclear norm.
33
Robust Multi-View Clustering with Noisy Correspondence
Yuan Sun,Yang Qin,Yongxiang Li,Dezhong Peng,Xi Peng,Peng Hu +5 more
TL;DR: This study proposes RMCNC, a novel method for robust multi-view clustering with noisy correspondence, alleviating misaligned data influence through cross-view alignment consistency and noise-tolerance contrastive loss, achieving competitive performance on eight benchmark datasets.
24
Joint Multi-View Unsupervised Feature Selection and Graph Learning
Si-Guo Fang,Dong Huang,Chang‐Dong Wang,Yong Tang +3 more
TL;DR: Joint multi-view unsupervised feature selection and graph learning approach that incorporates cross-space locality preservation and unified objective function for learning cluster structure, global and local similarity structures, and multi-view consistency and inconsistency.
21
Incomplete Multi-view Clustering via Prototype-based Imputation
Haobin Li,Yunfan Li,Mouxing Yang,Peng Hu,Dezhong Peng,Xi Peng +5 more
- 01 Aug 2023
TL;DR: Incomplete multi-view clustering (IMvC) model that preserves instance commonality and view versatility through prototype-based imputation.
References
Gradient-based learning applied to document recognition
Yann LeCun,Léon Bottou,Léon Bottou,Yoshua Bengio,Yoshua Bengio,Yoshua Bengio,Patrick Haffner +6 more
- 01 Jan 1998
TL;DR: In this article, a graph transformer network (GTN) is proposed for handwritten character recognition, which can be used to synthesize a complex decision surface that can classify high-dimensional patterns, such as handwritten characters.
53.5K
Some methods for classification and analysis of multivariate observations
James B. MacQueen
- 01 Jan 1967
TL;DR: The k-means algorithm as mentioned in this paper partitions an N-dimensional population into k sets on the basis of a sample, which is a generalization of the ordinary sample mean, and it is shown to give partitions which are reasonably efficient in the sense of within-class variance.
•Posted Content
Semi-Supervised Classification with Graph Convolutional Networks
Thomas Kipf,Max Welling +1 more
TL;DR: A scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs which outperforms related methods by a significant margin.
22.7K
Graph Attention Networks
Petar Veličković,Guillem Cucurull,Arantxa Casanova,Adriana Romero,Pietro Liò,Yoshua Bengio +5 more
- 15 Feb 2018
TL;DR: Graph Attention Networks (GATs) as mentioned in this paper leverage masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their approximations.
The Hungarian method for the assignment problem
TL;DR: This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory, and it may be of some interest to tell the story of its origin this article.