Generalized Canonical Correlation Analysis: A Subspace Intersection Approach

Abstract

Generalized Canonical Correlation Analysis (GCCA) is an important tool that finds numerous applications in data mining, machine learning, and artificial intelligence. It aims at finding `common' random variables that are strongly correlated across multiple feature representations (views) of the same set of entities. CCA and to a lesser extent GCCA have been studied from the statistical and algorithmic points of view, but not as much from the standpoint of linear algebra. This paper offers a fresh algebraic perspective of GCCA based on a (bi-)linear generative model that naturally captures its essence. It is shown that from a linear algebra point of view, GCCA is tantamount to subspace intersection; and conditions under which the common subspace of the different views is identifiable are provided. A novel GCCA algorithm is proposed based on subspace intersection, which scales up to handle large GCCA tasks. Synthetic as well as real data experiments are provided to showcase the effectiveness of the proposed approach.

References in corpus (7)

• A Tutorial on Canonical Correlation Methods
• Blind Identification of SIMO Wiener Systems based on Kernel Canonical Correlation Analysis
• Structured SUMCOR Multiview Canonical Correlation Analysis for Large-Scale Data
• Large scale canonical correlation analysis with iterative least squares
• A Randomized Algorithm for CCA
• Beyond CCA: Moment Matching for Multi-View Models
• Efficient Algorithms for Large-scale Generalized Eigenvector Computation and Canonical Correlation Analysis

Cited by in corpus (4)

• Multisubject Task-Related fMRI Data Processing via a Two-Stage Generalized Canonical Correlation Analysis
• Revisiting Deep Generalized Canonical Correlation Analysis
• Multi-Channel Factor Analysis: Identifiability and Asymptotics
• Communication-Efficient Federated Linear and Deep Generalized Canonical Correlation Analysis