.png){kind=icon}
Return
Sparse canonical correlation analysis
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-010-5222-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a novel method for solving Canonical Correlation Analysis (CCA) in a sparse convex framework using a least squares approach. The presented method focuses on the scenario when one is interested in (or limited to) a primal representation for the first view while having a dual representation for the second view. Sparse CCA (SCCA) minimises the number of features used in both the primal and dual projections while maximising the correlation between the two views. The method is compared to alternative sparse solutions as well as demonstrated on paired corpuses for mate-retrieval. We are able to observe, in the mate-retrieval, that when the number of the original features is large SCCA outperforms Kernel CCA (KCCA), learning the common semantic space from a sparse set of features.
Keywords:
Sparsity
Canonical correlation analysis
Journal
IF:
2.9
Papers:
2.7K
Citations:
3.4W
Organization
Cited Papers
Convergence analysis of kernel Canonical Correlation Analysis: theory and practice.png)
MACHINE LEARNINGOAAI
MACHINE LEARNINGIF2.9
OAAIShareSaveShareSaveShareSaveShareSaveAnatomical Substrates of the Alerting, Orienting and Executive Control Components of Attention: Focus on the Posterior Parietal LobePLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveShareSave
View more