A Least Squares Formulation for Canonical Correlation Analysis
Description
Canonical Correlation Analysis (CCA) is a well-known technique for finding the correlations between two sets of multi-dimensional variables. It projects both sets of variables into a lower-dimensional space in which they are maximally correlated. CCA is commonly applied for supervised dimensionality reduction, in which one of the multi-dimensional variables is derived from the class label. It has been shown that CCA can be formulated as a least squares problem in the binary-class case. However, their relationship in the more general setting remains unclear. In this paper, we show that, under a mild condition which tends to hold for high-dimensional data, CCA in multi-label classifications can be formulated as a least squares problem. Based on this equivalence relationship, we propose several CCA extensions including sparse CCA using 1-norm regularization. Experiments on multi-label data sets confirm the established equivalence relationship. Results also demonstrate the effectiveness of the proposed CCA extensions
| Slides | |
| 0:00 | Motivation - 1 |
| 1:45 | Motivation - 2 |
| 2:55 | Main Contributions |
| 3:32 | Outline |
| 3:48 | Background: CCA - 1 |
| 4:35 | Background: CCA - 2 |
| 5:34 | Background: CCA - 3 |
| 5:53 | Background: Multivariate Linear Regression |
| 7:07 | Background: MLR for Multi-label Classification |
| 8:03 | CCA Versus Multivariate Linear Regression |
| 8:41 | Notations and Definitions |
| 9:55 | Computing CCA via Eigendecomposition |
| 10:14 | Equivalence Relationship between CCA and MLR |
| 10:50 | Notations and Definitions |
| 10:57 | Equivalence Relationship between CCA and MLR |
| 13:00 | CCA Extensions: Regularized CCA |
| 13:44 | CCA Extensions: Sparse CCA |
| 14:03 | CCA Extensions: Entire CCA Solution Path |
| 14:19 | Experiment - Experimental Setup |
| 15:09 | Equivalence Relationship |
| 15:51 | Performance Comparison |
| 16:54 | Sensitivity Study |
| 19:18 | The Entire CCA Solution Path |
| 20:10 | - Questions |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !






very good