Open AccessPosted Content
Shared Generative Latent Representation Learning for Multi-view Clustering
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
Figures

Figure 1: The architecture of the proposed multi-view model. The data generative process under the deep autoencoders framework is performed in three steps. (a). A cluster is first picked from a pretrained GMM model; (b). A shared latent representation (embedding) weighted by each view is generated by the prior picked cluster; (c) DNN f(z; θ(v)) decodes the latent embedding into an observable x. To optimize the ELBO of the proposed model, the encoder network g(·) is applied. 
Figure 2: Visualization to show the latent subspaces of Caltech-7 dataset. 
Figure 3: Visualization to show the latent subspaces of UCI digits by DMVCVAE visualization from epoch 10 to 100. 
Table 3: Clustering performance comparison among the deep models. 
Table 2: Clustering performance comparison between the propose model and shallows methods. 
Table 4: Clustering performance for large-scale dataset.
Citations
Partially View-aligned Representation Learning with Noise-robust Contrastive Loss
Mouxing Yang,Yunfan Li,Zhenyu Huang,Zitao Liu,Peng Hu,Xi Peng +5 more
- 01 Jun 2021
TL;DR: In this article, a noise-robust contrastive loss is proposed to solve the partially view-aligned problem (PVP) without the help of labels, which can adaptively prevent the false negatives from dominating the network optimization.
Deep Clustering: A Comprehensive Survey
TL;DR: This paper provides a comprehensive survey for deep clustering in views of data sources, and systematically distinguish the clustering methods in terms of methodology, prior knowledge, and architecture.
Joint contrastive triple-learning for deep multi-view clustering
TL;DR: Hu et al. as discussed by the authors proposed a joint contrastive triple-learning framework to learn multi-view discriminative feature representation for deep clustering, which is threefold, i.e., feature-level alignment-oriented and commonality-oriented CL, and cluster-level consistencyoriented CL.
31
Multi-View Data Fusion Oriented Clustering via Nuclear Norm Minimization
TL;DR: A joint learning framework of multi-view image data fusion and clustering based on nuclear norm minimization that efficiently decomposes the multi-variable optimization problem into several small solvable sub-problems with closed-form solutions is proposed.
25
Adaptive Weighted Graph Fusion Incomplete Multi-View Subspace Clustering.
TL;DR: This paper proposes an adaptive weighted graph fusion incomplete multi-view subspace clustering (AWGF-IMSC) method, which incorporates feature extraction and incomplete graph fusion into a unified framework, whereas two processes can negotiate with each other, serving for graph learning tasks.
23
References
•Proceedings Article
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
- 01 Jan 2015
TL;DR: This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
138.5K
ImageNet: A large-scale hierarchical image database
Jia Deng,Wei Dong,Richard Socher,Li-Jia Li,Kai Li,Li Fei-Fei +5 more
- 20 Jun 2009
TL;DR: A new database called “ImageNet” is introduced, a large-scale ontology of images built upon the backbone of the WordNet structure, much larger in scale and diversity and much more accurate than the current image datasets.
•Journal Article
Visualizing Data using t-SNE
TL;DR: A new technique called t-SNE that visualizes high-dimensional data by giving each datapoint a location in a two or three-dimensional map, a variation of Stochastic Neighbor Embedding that is much easier to optimize, and produces significantly better visualizations by reducing the tendency to crowd points together in the center of the map.
Histograms of oriented gradients for human detection
Navneet Dalal,Bill Triggs +1 more
- 20 Jun 2005
TL;DR: It is shown experimentally that grids of histograms of oriented gradient (HOG) descriptors significantly outperform existing feature sets for human detection, and the influence of each stage of the computation on performance is studied.
•Proceedings Article
Auto-Encoding Variational Bayes
Diederik P. Kingma,Max Welling +1 more
- 01 Jan 2014
TL;DR: A stochastic variational inference and learning algorithm that scales to large datasets and, under some mild differentiability conditions, even works in the intractable case is introduced.