Generalized Canonical Correlation Analysis: A Subspace Intersection Approach
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...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2020-03 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Sørensen, Mikael Kanatsoulis, Charilaos I Sidiropoulos, Nicholas D |
| description | 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. |
| doi_str_mv | 10.48550/arxiv.2003.11205 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2003_11205</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2383285218</sourcerecordid><originalsourceid>FETCH-LOGICAL-a528-2f6920d6760eb1b24c1f65d8c0083249179393456a627e32ffc9302d7fd3e1e93</originalsourceid><addsrcrecordid>eNotj8FKw0AURQdBsNR-gCsDrlPfvJeZTNyFoG2h4MLuw2TygikxiTOtWL_e2Lq6m8O99whxJ2GZGKXg0frv9muJALSUEkFdiRkSydgkiDdiEcIeAFCnqBTNxHbFPXvbtT9cR4Xth751touKwXvu7KEd-ijvbXcKbXiK8ujtWIXROo42_YF9YHchxtEP1r3fiuvGdoEX_zkXu5fnXbGOt6-rTZFvY6vQxNjoDKHWqQauZIWJk41WtXEAhjDJZJpRRonSVmPKhE3jMgKs06YmlpzRXNxfas-q5ejbD-tP5Z9yeVaeiIcLMf36PHI4lPvh6CePUCJNI0ahNPQLRXJYHg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2383285218</pqid></control><display><type>article</type><title>Generalized Canonical Correlation Analysis: A Subspace Intersection Approach</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Sørensen, Mikael ; Kanatsoulis, Charilaos I ; Sidiropoulos, Nicholas D</creator><creatorcontrib>Sørensen, Mikael ; Kanatsoulis, Charilaos I ; Sidiropoulos, Nicholas D</creatorcontrib><description>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.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2003.11205</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Artificial intelligence ; Computer Science - Information Retrieval ; Computer Science - Learning ; Correlation analysis ; Data mining ; Linear algebra ; Machine learning ; Random variables ; Statistics - Machine Learning ; Subspaces</subject><ispartof>arXiv.org, 2020-03</ispartof><rights>2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,777,781,882,27906</link.rule.ids><backlink>$$Uhttps://doi.org/10.1109/TSP.2021.3061218$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2003.11205$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Sørensen, Mikael</creatorcontrib><creatorcontrib>Kanatsoulis, Charilaos I</creatorcontrib><creatorcontrib>Sidiropoulos, Nicholas D</creatorcontrib><title>Generalized Canonical Correlation Analysis: A Subspace Intersection Approach</title><title>arXiv.org</title><description>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.</description><subject>Algorithms</subject><subject>Artificial intelligence</subject><subject>Computer Science - Information Retrieval</subject><subject>Computer Science - Learning</subject><subject>Correlation analysis</subject><subject>Data mining</subject><subject>Linear algebra</subject><subject>Machine learning</subject><subject>Random variables</subject><subject>Statistics - Machine Learning</subject><subject>Subspaces</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj8FKw0AURQdBsNR-gCsDrlPfvJeZTNyFoG2h4MLuw2TygikxiTOtWL_e2Lq6m8O99whxJ2GZGKXg0frv9muJALSUEkFdiRkSydgkiDdiEcIeAFCnqBTNxHbFPXvbtT9cR4Xth751touKwXvu7KEd-ijvbXcKbXiK8ujtWIXROo42_YF9YHchxtEP1r3fiuvGdoEX_zkXu5fnXbGOt6-rTZFvY6vQxNjoDKHWqQauZIWJk41WtXEAhjDJZJpRRonSVmPKhE3jMgKs06YmlpzRXNxfas-q5ejbD-tP5Z9yeVaeiIcLMf36PHI4lPvh6CePUCJNI0ahNPQLRXJYHg</recordid><startdate>20200325</startdate><enddate>20200325</enddate><creator>Sørensen, Mikael</creator><creator>Kanatsoulis, Charilaos I</creator><creator>Sidiropoulos, Nicholas D</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>EPD</scope><scope>GOX</scope></search><sort><creationdate>20200325</creationdate><title>Generalized Canonical Correlation Analysis: A Subspace Intersection Approach</title><author>Sørensen, Mikael ; Kanatsoulis, Charilaos I ; Sidiropoulos, Nicholas D</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a528-2f6920d6760eb1b24c1f65d8c0083249179393456a627e32ffc9302d7fd3e1e93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Artificial intelligence</topic><topic>Computer Science - Information Retrieval</topic><topic>Computer Science - Learning</topic><topic>Correlation analysis</topic><topic>Data mining</topic><topic>Linear algebra</topic><topic>Machine learning</topic><topic>Random variables</topic><topic>Statistics - Machine Learning</topic><topic>Subspaces</topic><toplevel>online_resources</toplevel><creatorcontrib>Sørensen, Mikael</creatorcontrib><creatorcontrib>Kanatsoulis, Charilaos I</creatorcontrib><creatorcontrib>Sidiropoulos, Nicholas D</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv Statistics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sørensen, Mikael</au><au>Kanatsoulis, Charilaos I</au><au>Sidiropoulos, Nicholas D</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Generalized Canonical Correlation Analysis: A Subspace Intersection Approach</atitle><jtitle>arXiv.org</jtitle><date>2020-03-25</date><risdate>2020</risdate><eissn>2331-8422</eissn><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.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2003.11205</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2020-03 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_2003_11205 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Artificial intelligence Computer Science - Information Retrieval Computer Science - Learning Correlation analysis Data mining Linear algebra Machine learning Random variables Statistics - Machine Learning Subspaces |
| title | Generalized Canonical Correlation Analysis: A Subspace Intersection Approach |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T08%3A47%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Generalized%20Canonical%20Correlation%20Analysis:%20A%20Subspace%20Intersection%20Approach&rft.jtitle=arXiv.org&rft.au=S%C3%B8rensen,%20Mikael&rft.date=2020-03-25&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2003.11205&rft_dat=%3Cproquest_arxiv%3E2383285218%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2383285218&rft_id=info:pmid/&rfr_iscdi=true |