While neural networks for learning representation of multi-view data have been previously proposed as one of the state-of-the-art multi-view dimension reduction techniques, how to make the representation discriminative with only a small amount of labeled data is not well-studied. We introduce a semi-supervised neural n…
Proposes a deep probabilistic multi-view model for multi-view learning.
problem Learning from multiple related views with shared latent structure.
method Probabilistic Canonical Correlation Analysis (CCA) in latent space, deep generative networks, variational inference.
result Efficient variational inference approximates posterior distributions of latent multi-view layer.
A simple framework Probabilistic Multi-view Graph Embedding (PMvGE) is proposed for multi-view feature learning with many-to-many associations so that it generalizes various existing multi-view methods. PMvGE is a probabilistic model for predicting new associations via graph embedding of the nodes of data vectors with …
ANN clusters multi-view data by agglomerating subviews and avoiding postprocessing.
problem Challenges in multi-view clustering, especially subview agglomeration.
method Agglomerative Neural Network (ANN) using Constrained Laplacian Rank.
result ANN outperforms state-of-the-art methods in multi-view clustering.
Network analysis of human brain connectivity is critically important for understanding brain function and disease states. Embedding a brain network as a whole graph instance into a meaningful low-dimensional representation can be used to investigate disease mechanisms and inform therapeutic interventions. Moreover, by …
This paper proposes multi-view attack strategies for deep models.
problem Vulnerability of multi-view deep models to adversarial attacks.
method Two multi-view attack strategies: two-stage attack (TSA) and end-to-end attack (ETEA).
result Proposed multi-view attack strategies are effective on multi-view deep models.
Proposes MANE for multi-view network embedding, improving node representations.
problem Learning low-dimensional representations from multiple views of networks.
method MANE combines diversity and collaboration, including second-order collaboration, and attention-based extension MANE+.
result MANE+ outperforms state-of-the-art approaches on real-world multi-view networks.
With the rapid expansion of mobile phone networks in developing countries, large-scale graph machine learning has gained sudden relevance in the study of global poverty. Recent applications range from humanitarian response and poverty estimation to urban planning and epidemic containment. Yet the vast majority of compu…
Framework for generating multiple clusterings from multi-view data.
problem Challenges in finding optimal clustering criteria and handling incomplete multi-view data.
method DiMVMC framework that optimizes multiple decoder deep networks to complete data views and generate shared representations.
result DiMVMC outperforms state-of-the-art competitors in generating multiple clusterings with high diversity and quality.
DICCA maps multi-view data into a shared latent space with interpretable components.
problem Learning from multiple related but distinct data views.
method DICCA extends CCA to deep generative networks and uses sparsity-inducing priors for interpretability.
result DICCA effectively disentangles shared and view-specific variations in multi-view data.
Model integrates multi-view temporal data for better understanding of latent dynamics.
problem Understanding time-dependent heterogeneous properties from multi-view data.
method Generative model using variational autoencoder and recurrent neural network.
result Identifies disentangled latent embeddings across views while accounting for time factor.
LargeMvC-Net improves scalability of multi-view clustering.
problem Scalability issues in multi-view clustering.
method Deep unfolding of multi-view clustering into a network architecture with three modules.
result LargeMvC-Net consistently outperforms state-of-the-art methods in scalability and effectiveness.
OpenViewer tackles multi-view learning challenges with interpretability and generalization.
problem Lack of interpretability and insufficient generalization in multi-view learning models.
method OpenViewer introduces a Pseudo-Unknown Sample Generation Mechanism, Expression-Enhanced Deep Unfolding Network, and Perception-Augmented Open-Set Training Regime.
result OpenViewer effectively addresses openness challenges and enhances recognition performance for both known and unknown samples.
Acoustic word embeddings --- fixed-dimensional vector representations of arbitrary-length words --- have attracted increasing interest in query-by-example spoken term detection. Recently, on the fact that the orthography of text labels partly reflects the phonetic similarity between the words' pronunciation, a multi-vi…
SpecRaGE learns robust multi-view representations using graph Laplacians and neural networks.
problem Challenges in generalizing and scaling multi-view representation learning methods.
method SpecRaGE integrates graph Laplacian methods with neural networks to learn robust representations.
result SpecRaGE outperforms state-of-the-art methods in noisy and contaminated data scenarios.
We present a Bayesian hierarchical multi-view mixture model termed Symphony that simultaneously learns clusters of cells representing cell types and their underlying gene regulatory networks by integrating data from two views: single-cell gene expression data and paired epigenetic data, which is informative of gene-gen…
LineMVGNN improves AML detection by integrating multi-view graph learning.
problem Ineffective and scalable AML systems using rule-based methods.
method LineMVGNN combines multi-view graph neural networks with line-graph features.
result LineMVGNN outperforms state-of-the-art methods in detecting money laundering.
Suffering from the multi-view data diversity and complexity for semi-supervised classification, most of existing graph convolutional networks focus on the networks architecture construction or the salient graph structure preservation, and ignore the the complete graph structure for semi-supervised classification contri…
Study community detection in multi-view data with various types of information.
problem Community detection in multi-view data with different types of information.
method Unified theoretical framework, mutual information analysis, sharp thresholds, iterative algorithms.
result Sharp thresholds for community recovery in various multi-view settings.
Current multi-view factorization methods make assumptions that are not acceptable for many kinds of data, and in particular, for graphical data with hierarchical structure. At the same time, current hierarchical methods work only in the single-view setting. We generalize the Treelet Transform to the Multi-View Treelet …
We study the problem of learning to rank from multiple information sources. Though multi-view learning and learning to rank have been studied extensively leading to a wide range of applications, multi-view learning to rank as a synergy of both topics has received little attention. The aim of the paper is to propose a c…
Proposes MvLPE for better multi-view representation learning.
problem Learning representations from multi-view data with varying correlations.
method Integrates multi-view data into a centroid view while maintaining low-rank reconstruction relations.
result MvLPE outperforms existing methods on benchmark datasets.
This paper introduces a novel framework for generative models based on Restricted Kernel Machines (RKMs) with joint multi-view generation and uncorrelated feature learning, called Gen-RKM. To enable joint multi-view generation, this mechanism uses a shared representation of data from various views. Furthermore, the mod…
In this paper we examine data fusion methods for multi-view data classification. We present a decision concept which explicitly takes into account the input multi-view structure, where for each case there is a different subset of relevant views. This data fusion concept, which we dub Mixture of Views, is implemented by…
Multi-view learning can provide self-supervision when different views are available of the same data. The distributional hypothesis provides another form of useful self-supervision from adjacent sentences which are plentiful in large unlabelled corpora. Motivated by the asymmetry in the two hemispheres of the human bra…
Error-robust multi-view clustering tackles noisy data across multiple sources.
problem Error in multi-view data degrades clustering performance.
method Blind clustering without error consideration is ineffective. Various approaches like sparsity, graph, subspace, and deep learning are reviewed.
result Error-robust multi-view clustering improves clustering accuracy even with corrupted data.
Multi-view clustering is a learning paradigm based on multi-view data. Since statistic properties of different views are diverse, even incompatible, few approaches implement multi-view clustering based on the concatenated features straightforward. However, feature concatenation is a natural way to combine multi-view da…
MV-GNN improves molecular property prediction by integrating atom and bond information.
problem Accurately predicting molecular properties using graph neural networks.
method Multi-View Graph Neural Network (MV-GNN) architecture with shared self-attentive readout and cross-dependent message passing.
result MV-GNN achieves superior performance on molecular property prediction benchmarks.
Enhances robustness of multi-view clustering via partition fusion.
problem Dealing with noises and inconsistency in multi-view data.
method Generates multiple partitions, integrates them, and co-evolves graph learning, partition generation, and view weight learning.
result Empirical results verify the effectiveness and robustness of the proposed approach.
Federated multi-view matrix factorization learns from multiple data sources without centralizing user data.
problem Cold-start federated recommendations and multi-view data structure.
method Federated learning framework extended to multi-view matrix factorization.
result Federated multi-view matrix factorization outperforms simpler methods in cold-start federated recommendations.
Proposes CI-GMVC to improve graph-based multi-view clustering performance.
problem Inconsistency in multi-view data affects clustering performance.
method Integrates consistent and inconsistent parts of multiple views using a unified matrix.
result Demonstrates improved clustering performance on real-world datasets.
DEMVC improves multi-view clustering with collaborative training and deep autoencoders.
problem Existing multi-view clustering methods have high computation and space complexities or lack representation capability.
method DEMVC learns embedded representations of multiple views individually using deep autoencoders and collaboratively trains all views.
result DEMVC achieves significant improvements over state-of-the-art methods on multi-view datasets.
Unified multi-view learning framework using OPLS with regularization and deep extensions.
problem Improving multi-view learning for classification and feature extraction.
method Orthonormalized Partial Least Squares (OPLS) with regularization and deep extensions.
result Unified multi-view learning framework with improved performance.
Proposes KMvDA for object recognition from multi-view data.
problem Recognizing objects from different views, even when views are heterogeneous.
method Introduces kernel multi-view discriminant analysis (KMvDA) and uses random Fourier features (RFF) for large-scale learning.
result KMvDA and RFF approximation improve object recognition from multi-view data.
Proposes a new multi-view graph learning framework to model consistency and inconsistency.
problem Graph learning methods often neglect inconsistency across multiple views, making them vulnerable to noisy datasets.
method Proposes a unified objective function to simultaneously model consistency and inconsistency, iteratively learning consistent and unified graphs.
result Demonstrates robustness and efficiency of the proposed approach on twelve multi-view datasets.
With advances in information acquisition technologies, multi-view data become ubiquitous. Multi-view learning has thus become more and more popular in machine learning and data mining fields. Multi-view unsupervised or semi-supervised learning, such as co-training, co-regularization has gained considerable attention. A…
Paper proposes Adversarial CCA for multi-view alignment and generation.
problem Aligning multiple views in cross-view data analysis problems.
method Bayesian perspective, adversarial training for consistent latent encodings.
result ACCA model achieves superior performance in multi-view alignment and generation.
PROTOCOL tackles imbalanced multi-view clustering by enhancing contrastive learning.
problem Class imbalance in real-world multi-view data.
method PROTOCOL uses partial optimal transport to perceive and mitigate imbalance, enhancing contrastive learning.
result PROTOCOL significantly improves clustering performance on imbalanced multi-view data.
Unified framework for multi-view autoencoders simplifies model implementation and evaluation.
problem Inconsistent notation and implementation of multi-view autoencoders.
method Unified mathematical framework, documentation, and Python library.
result Comparable or superior performance in benchmarking experiments.
A novel method for clustering multi-view data using dual representations.
problem Clustering multi-view data with consistent and unique information.
method One-step multi-view clustering method exploiting dual representations.
result The proposed method improves clustering performance on benchmark datasets.
Unified framework for multi-view learning with orthogonal projections.
problem Learning individual orthogonal projections for multiple views.
method Successive approximations via eigenvectors, iterative Krylov subspace method.
result Consistently competitive and often better than existing methods.
Multiple clustering aims at exploring alternative clusterings to organize the data into meaningful groups from different perspectives. Existing multiple clustering algorithms are designed for single-view data. We assume that the individuality and commonality of multi-view data can be leveraged to generate high-quality …
Multi-view clustering has received much attention recently. Most of the existing multi-view clustering methods only focus on one-sided clustering. As the co-occurring data elements involve the counts of sample-feature co-occurrences, it is more efficient to conduct two-sided clustering along the samples and features si…
New method clusters multi-view data by squeezing hybrid knowledge.
problem Removal of redundant information and fusion of multi-view features.
method Low-rank subspace multi-view clustering with adaptive graph regularization.
result Our method outperforms state-of-the-art algorithms on multi-view benchmarks.
We propose to jointly learn multi-view geometry and warping between views of the same object instances for robust cross-view object detection. What makes multi-view object instance detection difficult are strong changes in viewpoint, lighting conditions, high similarity of neighbouring objects, and strong variability i…
Fine-grained pretraining improves neural network's ability to learn rare features.
problem Improving generalization in deep learning models.
method Introducing a hierarchical multi-view structure to confine input data distribution.
result Fine-grained pretraining leads to better accuracy on hard downstream test samples.
Proposes CRG_IMSC for better clustering of multi-view data.
problem Lack of effective connectivity in clustering results.
method Directly obtains clustering result with nonnegative constraint; constructs connectivity matrix based on spectral clustering result; uses multiplicative update algorithm.
result Improves clustering performance on benchmark datasets.
Proposes a method to enhance multi-view learning by maximizing higher order correlations.
problem Losing intrinsic interconnections among multiple views in pairwise correlation maximization.
method Formulates multi-view data as a low rank approximation problem using higher order correlation tensor and solves it with the generating polynomial method.
result Consistently outperforms prior methods on real multi-view data.