Randomized Kernel Multi-view Discriminant Analysis
- URL: http://arxiv.org/abs/2004.01143v1
- Date: Thu, 2 Apr 2020 17:15:32 GMT
- Title: Randomized Kernel Multi-view Discriminant Analysis
- Authors: Xiaoyun Li, Jie Gui, Ping Li
- Abstract summary: Multi-view discriminant analysis (MvDA) is an effective multi-view subspace learning method.
We propose the kernel version of multi-view discriminant analysis, called kernel multi-view discriminant analysis (KMvDA)
- Score: 41.989132939870146
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In many artificial intelligence and computer vision systems, the same object
can be observed at distinct viewpoints or by diverse sensors, which raises the
challenges for recognizing objects from different, even heterogeneous views.
Multi-view discriminant analysis (MvDA) is an effective multi-view subspace
learning method, which finds a discriminant common subspace by jointly learning
multiple view-specific linear projections for object recognition from multiple
views, in a non-pairwise way. In this paper, we propose the kernel version of
multi-view discriminant analysis, called kernel multi-view discriminant
analysis (KMvDA). To overcome the well-known computational bottleneck of kernel
methods, we also study the performance of using random Fourier features (RFF)
to approximate Gaussian kernels in KMvDA, for large scale learning. Theoretical
analysis on stability of this approximation is developed. We also conduct
experiments on several popular multi-view datasets to illustrate the
effectiveness of our proposed strategy.
Related papers
- Advancing Person Re-Identification: Tensor-based Feature Fusion and
Multilinear Subspace Learning [0.6829272097221595]
We propose a novel PRe-ID system that combines feature representation and multilinear subspace learning.
Our method exploits the power of pre-trained Conrimial Neural Networks (CNNs) as a strong deep feature extractor.
We evaluate our approach by conducting experiments on three datasets VIPeR, GRID, and PRID450s.
arXiv Detail & Related papers (2023-12-24T16:19:22Z) - 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) - Multi-view Data Visualisation via Manifold Learning [0.03222802562733786]
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.
arXiv Detail & Related papers (2021-01-17T19:54:36Z) - 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) - Deep Representational Similarity Learning for analyzing neural
signatures in task-based fMRI dataset [81.02949933048332]
This paper develops Deep Representational Similarity Learning (DRSL), a deep extension of Representational Similarity Analysis (RSA)
DRSL is appropriate for analyzing similarities between various cognitive tasks in fMRI datasets with a large number of subjects.
arXiv Detail & Related papers (2020-09-28T18:30:14Z) - Spectral Analysis Network for Deep Representation Learning and Image
Clustering [53.415803942270685]
This paper proposes a new network structure for unsupervised deep representation learning based on spectral analysis.
It can identify the local similarities among images in patch level and thus more robust against occlusion.
It can learn more clustering-friendly representations and is capable to reveal the deep correlations among data samples.
arXiv Detail & Related papers (2020-09-11T05:07:15Z) - Embedded Deep Bilinear Interactive Information and Selective Fusion for
Multi-view Learning [70.67092105994598]
We propose a novel multi-view learning framework to make the multi-view classification better aimed at the above-mentioned two aspects.
In particular, we train different deep neural networks to learn various intra-view representations.
Experiments on six publicly available datasets demonstrate the effectiveness of the proposed method.
arXiv Detail & Related papers (2020-07-13T01:13:23Z) - Bayesian Sparse Factor Analysis with Kernelized Observations [67.60224656603823]
Multi-view problems can be faced with latent variable models.
High-dimensionality and non-linear issues are traditionally handled by kernel methods.
We propose merging both approaches into single model.
arXiv Detail & Related papers (2020-06-01T14:25:38Z) - Variational Inference for Deep Probabilistic Canonical Correlation
Analysis [49.36636239154184]
We propose a deep probabilistic multi-view model that is composed of a linear multi-view layer and deep generative networks as observation models.
An efficient variational inference procedure is developed that approximates the posterior distributions of the latent probabilistic multi-view layer.
A generalization to models with arbitrary number of views is also proposed.
arXiv Detail & Related papers (2020-03-09T17:51:15Z)
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.