Sparse Canonical Correlation Analysis
Abstract
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.
Cite
Text
Hardoon and Shawe-Taylor. "Sparse Canonical Correlation Analysis." Machine Learning, 2011. doi:10.1007/S10994-010-5222-7Markdown
[Hardoon and Shawe-Taylor. "Sparse Canonical Correlation Analysis." Machine Learning, 2011.](https://mlanthology.org/mlj/2011/hardoon2011mlj-sparse/) doi:10.1007/S10994-010-5222-7BibTeX
@article{hardoon2011mlj-sparse,
title = {{Sparse Canonical Correlation Analysis}},
author = {Hardoon, David R. and Shawe-Taylor, John},
journal = {Machine Learning},
year = {2011},
pages = {331-353},
doi = {10.1007/S10994-010-5222-7},
volume = {83},
url = {https://mlanthology.org/mlj/2011/hardoon2011mlj-sparse/}
}