IEEE Transactions on Knowledge and Data Engineering· 2015Q1
Tensor Canonical Correlation Analysis for Multi-View Dimension Reduction
- 252citations
- Q1SCImago
- 2015year
Short summary
Tensor CCA (TCCA) generalizes Canonical Correlation Analysis to handle data with more than two views, achieving this by finding the best rank-1 approximation of the data covariance tensor via alternating least squares.
AI-generated from the title and abstract; the full text is not read.
Key points
- TCCA generalizes CCA to handle data with more than two views.
- The method analyzes the covariance tensor of different views.
- Maximizing multi-view canonical correlation is equivalent to finding the best rank-1 approximation of the data covariance tensor.
- The rank-1 approximation is solved efficiently using the alternating least squares (ALS) algorithm.
- A non-linear extension of TCCA is also presented.
AI-generated from the title and abstract; the full text is not read.
Abstract
Canonical correlation analysis (CCA) has proven an effective tool for two-view dimension reduction due to its profound theoretical foundation and success in practical applications. In respect of multi-view learning, however, it is limited by its capability of only handling data represented by two-view features, while in many real-world applications, the number of views is frequently many more. Although the ad hoc way of simultaneously exploring all possible pairs of features can numerically deal with multi-view data, it ignores the high order statistics (correlation information) which can only be discovered by simultaneously exploring all features. Therefore, in this work, we develop tensor CCA (TCCA) which straightforwardly yet naturally generalizes CCA to handle the data of an arbitrary number of views by analyzing the covariance tensor of the different views. TCCA aims to directly maximize the canonical correlation of multiple (more than two) views. Crucially, we prove that the main problem of multi-view canonical correlation maximization is equivalent to finding the best rank-1 approximation of the data covariance tensor, which can be solved efficiently using the well-known alternating least squares (ALS) algorithm. As a consequence, the high order correlation information contained in the different views is explored and thus a more reliable common subspace shared by all features can be obtained. In addition, a non-linear extension of TCCA is presented. Experiments on various challenge tasks, including large scale biometric structure prediction, internet advertisement classification, and web image annotation, demonstrate the effectiveness of the proposed method.
The authors' abstract, as published at the source. IEEE Transactions on Knowledge and Data Engineering, 2015 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Computational Mathematics
Computational MathematicsMathematics