Multi-view Data Visualisation via Manifold Learning
- URL: http://arxiv.org/abs/2101.06763v1
- Date: Sun, 17 Jan 2021 19:54:36 GMT
- Title: Multi-view Data Visualisation via Manifold Learning
- Authors: Theodoulos Rodosthenous and Vahid Shahrezaei and Marina Evangelou
- Abstract summary: This manuscript proposes extensions of Student's t-distributed SNE, LLE and ISOMAP, to allow for dimensionality reduction and visualisation of multi-view data.
We show that by incorporating the low-dimensional embeddings obtained via the multi-view manifold learning approaches into the K-means algorithm, clusters of the samples are accurately identified.
- Score: 0.03222802562733786
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: Manifold learning approaches, such as Stochastic Neighbour Embedding (SNE),
Locally Linear Embedding (LLE) and Isometric Feature Mapping (ISOMAP) have been
proposed for performing non-linear dimensionality reduction. These methods aim
to produce two or three latent embeddings, in order to visualise the data in
intelligible representations. This manuscript proposes extensions of Student's
t-distributed SNE (t-SNE), LLE and ISOMAP, to allow for dimensionality
reduction and subsequent visualisation of multi-view data.
Nowadays, it is very common to have multiple data-views on the same samples.
Each data-view contains a set of features describing different aspects of the
samples. For example, in biomedical studies it is possible to generate multiple
OMICS data sets for the same individuals, such as transcriptomics, genomics,
epigenomics, enabling better understanding of the relationships between the
different biological processes.
Through the analysis of real and simulated datasets, the visualisation
performance of the proposed methods is illustrated. Data visualisations have
been often utilised for identifying any potential clusters in the data sets. We
show that by incorporating the low-dimensional embeddings obtained via the
multi-view manifold learning approaches into the K-means algorithm, clusters of
the samples are accurately identified. Our proposed multi-SNE method
outperforms the corresponding multi-ISOMAP and multi-LLE proposed methods.
Interestingly, multi-SNE is found to have comparable performance with methods
proposed in the literature for performing multi-view clustering.
Related papers
- Convolutional autoencoder-based multimodal one-class classification [80.52334952912808]
One-class classification refers to approaches of learning using data from a single class only.
We propose a deep learning one-class classification method suitable for multimodal data.
arXiv Detail & Related papers (2023-09-25T12:31:18Z) - Scalable Randomized Kernel Methods for Multiview Data Integration and
Prediction [4.801208484529834]
We develop scalable randomized kernel methods for jointly associating data from multiple sources and simultaneously predicting an outcome or classifying a unit into one of two or more classes.
The proposed methods model nonlinear relationships in multiview data together with predicting a clinical outcome and are capable of identifying variables or groups of variables that best contribute to the relationships among the views.
arXiv Detail & Related papers (2023-04-10T16:14:42Z) - 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) - Cross-view Graph Contrastive Representation Learning on Partially
Aligned Multi-view Data [52.491074276133325]
Multi-view representation learning has developed rapidly over the past decades and has been applied in many fields.
We propose a new cross-view graph contrastive learning framework, which integrates multi-view information to align data and learn latent representations.
Experiments conducted on several real datasets demonstrate the effectiveness of the proposed method on the clustering and classification tasks.
arXiv Detail & Related papers (2022-11-08T09:19:32Z) - Subspace-Contrastive Multi-View Clustering [0.0]
We propose a novel Subspace-Contrastive Multi-View Clustering (SCMC) approach.
We employ view-specific auto-encoders to map the original multi-view data into compact features perceiving its nonlinear structures.
To demonstrate the effectiveness of the proposed model, we conduct a large number of comparative experiments on eight challenge datasets.
arXiv Detail & Related papers (2022-10-13T07:19:37Z) - S-multi-SNE: Semi-Supervised Classification and Visualisation of
Multi-View Data [0.03222802562733786]
Multi-view data corresponds to multiple data-views, each representing a different aspect of the same set of samples.
We have recently proposed multi-SNE, an extension of t-SNE, that produces a single visualisation of multi-view data.
Here, we extend multi-SNE to a semi-supervised approach, that classifies unlabelled samples by regarding the labelling information as an extra data-view.
arXiv Detail & Related papers (2021-11-05T14:19:28Z) - A Variational Information Bottleneck Approach to Multi-Omics Data
Integration [98.6475134630792]
We propose a deep variational information bottleneck (IB) approach for incomplete multi-view observations.
Our method applies the IB framework on marginal and joint representations of the observed views to focus on intra-view and inter-view interactions that are relevant for the target.
Experiments on real-world datasets show that our method consistently achieves gain from data integration and outperforms state-of-the-art benchmarks.
arXiv Detail & Related papers (2021-02-05T06:05:39Z) - Orthogonal Multi-view Analysis by Successive Approximations via
Eigenvectors [7.870955752916424]
The framework integrates the correlations within multiple views, supervised discriminant capacity, and distance preservation.
It not only includes several existing models as special cases, but also inspires new novel models.
Experiments are conducted on various real-world datasets for multi-view discriminant analysis and multi-view multi-label classification.
arXiv Detail & Related papers (2020-10-04T17:16:15Z) - Learning Inter- and Intra-manifolds for Matrix Factorization-based
Multi-Aspect Data Clustering [3.756550107432323]
Clustering on the data with multiple aspects, such as multi-view or multi-type relational data, has become popular in recent years.
We propose to include the inter-manifold in the NMF framework, utilizing the distance information of data points of different data types (or views) to learn the diverse manifold for data clustering.
Results on several datasets demonstrate that the proposed method outperforms the state-of-the-art multi-aspect data clustering methods in both accuracy and efficiency.
arXiv Detail & Related papers (2020-09-07T02:21:08Z) - Unsupervised Multi-view Clustering by Squeezing Hybrid Knowledge from
Cross View and Each View [68.88732535086338]
This paper proposes a new multi-view clustering method, low-rank subspace multi-view clustering based on adaptive graph regularization.
Experimental results for five widely used multi-view benchmarks show that our proposed algorithm surpasses other state-of-the-art methods by a clear margin.
arXiv Detail & Related papers (2020-08-23T08:25:06Z) - 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.