Agglomerative Neural Networks for Multi-view Clustering
- URL: http://arxiv.org/abs/2005.05556v1
- Date: Tue, 12 May 2020 05:39:10 GMT
- Title: Agglomerative Neural Networks for Multi-view Clustering
- Authors: Zhe Liu, Yun Li, Lina Yao, Xianzhi Wang and Feiping Nie
- Abstract summary: We propose the agglomerative analysis to approximate the optimal consensus view.
We present Agglomerative Neural Network (ANN) based on Constrained Laplacian Rank to cluster multi-view data directly.
Our evaluations against several state-of-the-art multi-view clustering approaches on four popular datasets show the promising view-consensus analysis ability of ANN.
- Score: 109.55325971050154
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Conventional multi-view clustering methods seek for a view consensus through
minimizing the pairwise discrepancy between the consensus and subviews.
However, the pairwise comparison cannot portray the inter-view relationship
precisely if some of the subviews can be further agglomerated. To address the
above challenge, we propose the agglomerative analysis to approximate the
optimal consensus view, thereby describing the subview relationship within a
view structure. We present Agglomerative Neural Network (ANN) based on
Constrained Laplacian Rank to cluster multi-view data directly while avoiding a
dedicated postprocessing step (e.g., using K-means). We further extend ANN with
learnable data space to handle data of complex scenarios. Our evaluations
against several state-of-the-art multi-view clustering approaches on four
popular datasets show the promising view-consensus analysis ability of ANN. We
further demonstrate ANN's capability in analyzing complex view structures and
extensibility in our case study and explain its robustness and effectiveness of
data-driven modifications.
Related papers
- Partial Multi-View Clustering via Meta-Learning and Contrastive Feature Alignment [13.511433241138702]
Partial multi-view clustering (PVC) presents significant challenges practical research problem for data analysis in real-world applications.
Existing clustering methods struggle to handle incomplete views effectively, leading to suboptimal clustering performance.
We propose a novel dual optimization framework based on contrastive learning, which aims to maximize the consistency of latent features in incomplete multi-view data.
arXiv Detail & Related papers (2024-11-14T19:16:01Z) - SLRL: Structured Latent Representation Learning for Multi-view Clustering [24.333292079699554]
Multi-View Clustering (MVC) aims to exploit the inherent consistency and complementarity among different views to improve clustering outcomes.
Despite extensive research in MVC, most existing methods focus predominantly on harnessing complementary information across views to enhance clustering effectiveness.
We introduce a novel framework, termed Structured Latent Representation Learning based Multi-View Clustering method.
arXiv Detail & Related papers (2024-07-11T09:43:57Z) - One for all: A novel Dual-space Co-training baseline for Large-scale
Multi-View Clustering [42.92751228313385]
We propose a novel multi-view clustering model, named Dual-space Co-training Large-scale Multi-view Clustering (DSCMC)
The main objective of our approach is to enhance the clustering performance by leveraging co-training in two distinct spaces.
Our algorithm has an approximate linear computational complexity, which guarantees its successful application on large-scale datasets.
arXiv Detail & Related papers (2024-01-28T16:30:13Z) - Multi-View Clustering via Semi-non-negative Tensor Factorization [120.87318230985653]
We develop a novel multi-view clustering based on semi-non-negative tensor factorization (Semi-NTF)
Our model directly considers the between-view relationship and exploits the between-view complementary information.
In addition, we provide an optimization algorithm for the proposed method and prove mathematically that the algorithm always converges to the stationary KKT point.
arXiv Detail & Related papers (2023-03-29T14:54:19Z) - Deep Incomplete Multi-view Clustering with Cross-view Partial Sample and
Prototype Alignment [50.82982601256481]
We propose a Cross-view Partial Sample and Prototype Alignment Network (CPSPAN) for Deep Incomplete Multi-view Clustering.
Unlike existing contrastive-based methods, we adopt pair-observed data alignment as 'proxy supervised signals' to guide instance-to-instance correspondence construction.
arXiv Detail & Related papers (2023-03-28T02:31:57Z) - Adaptively-weighted Integral Space for Fast Multiview Clustering [54.177846260063966]
We propose an Adaptively-weighted Integral Space for Fast Multiview Clustering (AIMC) with nearly linear complexity.
Specifically, view generation models are designed to reconstruct the view observations from the latent integral space.
Experiments conducted on several realworld datasets confirm the superiority of the proposed AIMC method.
arXiv Detail & Related papers (2022-08-25T05:47:39Z) - ACTIVE:Augmentation-Free Graph Contrastive Learning for Partial
Multi-View Clustering [52.491074276133325]
We propose an augmentation-free graph contrastive learning framework to solve the problem of partial multi-view clustering.
The proposed approach elevates instance-level contrastive learning and missing data inference to the cluster-level, effectively mitigating the impact of individual missing data on clustering.
arXiv Detail & Related papers (2022-03-01T02:32:25Z) - Attentive Multi-View Deep Subspace Clustering Net [4.3386084277869505]
We propose a novel Attentive Multi-View Deep Subspace Nets (AMVDSN)
Our proposed method seeks to find a joint latent representation that explicitly considers both consensus and view-specific information.
The experimental results on seven real-world data sets have demonstrated the effectiveness of our proposed algorithm against some state-of-the-art subspace learning approaches.
arXiv Detail & Related papers (2021-12-23T12:57:26Z) - Incomplete Multi-view Clustering via Cross-view Relation Transfer [41.17336912278538]
We propose a novel incomplete multi-view clustering framework, which incorporates cross-view relation transfer and multi-view fusion learning.
Experiments conducted on several real datasets demonstrate the effectiveness of the proposed method.
arXiv Detail & Related papers (2021-12-01T14:28:15Z) - Generative Partial Multi-View Clustering [133.36721417531734]
We propose a generative partial multi-view clustering model, named as GP-MVC, to address the incomplete multi-view problem.
First, multi-view encoder networks are trained to learn common low-dimensional representations, followed by a clustering layer to capture the consistent cluster structure across multiple views.
Second, view-specific generative adversarial networks are developed to generate the missing data of one view conditioning on the shared representation given by other views.
arXiv Detail & Related papers (2020-03-29T17:48:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.