Robust Group Subspace Recovery: A New Approach for Multi-Modality Data Fusion
Robust Subspace Recovery (RoSuRe) algorithm was recently introduced as a principled and numerically efficient algorithm that unfolds underlying Unions of Subspaces (UoS) structure, present in the data. The union of Subspaces (UoS) is capable of identifying more complex trends in data sets than simpl...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2020-06 |
---|---|
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 | Ghanem, Sally Panahi, Ashkan Krim, Hamid Kerekes, Ryan A |
description | Robust Subspace Recovery (RoSuRe) algorithm was recently introduced as a principled and numerically efficient algorithm that unfolds underlying Unions of Subspaces (UoS) structure, present in the data. The union of Subspaces (UoS) is capable of identifying more complex trends in data sets than simple linear models. We build on and extend RoSuRe to prospect the structure of different data modalities individually. We propose a novel multi-modal data fusion approach based on group sparsity which we refer to as Robust Group Subspace Recovery (RoGSuRe). Relying on a bi-sparsity pursuit paradigm and non-smooth optimization techniques, the introduced framework learns a new joint representation of the time series from different data modalities, respecting an underlying UoS model. We subsequently integrate the obtained structures to form a unified subspace structure. The proposed approach exploits the structural dependencies between the different modalities data to cluster the associated target objects. The resulting fusion of the unlabeled sensors' data from experiments on audio and magnetic data has shown that our method is competitive with other state of the art subspace clustering methods. The resulting UoS structure is employed to classify newly observed data points, highlighting the abstraction capacity of the proposed method. |
doi_str_mv | 10.48550/arxiv.2006.10657 |
format | Article |
fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2006_10657</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2414909178</sourcerecordid><originalsourceid>FETCH-LOGICAL-a528-9d99d0dbbc14e567b605e10883d64dd5548735b10f80b79a49960d162657a9ee3</originalsourceid><addsrcrecordid>eNotj81OAjEYRRsTEwnyAK5s4nrw6--07ggKmoAmyH7STkscgnRspyhv7wiu7ubk5hyEbgiMuRIC7k38aQ5jCiDHBKQoL9CAMkYKxSm9QqOUtgBAZUmFYAO0XAWbU4fnMeQWv2ebWlN7vPJ1OPh4fMAT_Oq_8aRtYzD1B96EiJd51zXFMjiza7ojfjSdwbOcmrC_Rpcbs0t-9L9DtJ49rafPxeJt_jKdLAojqCq009qBs7Ym3AtZWgnCE1CKOcmdE4KrkglLYKPAltpwrSU4ImlfY7T3bIhuz7en1qqNzaeJx-qvuTo198Tdmei1v7JPXbUNOe57p4pywjVoUir2CyGpV-A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2414909178</pqid></control><display><type>article</type><title>Robust Group Subspace Recovery: A New Approach for Multi-Modality Data Fusion</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Ghanem, Sally ; Panahi, Ashkan ; Krim, Hamid ; Kerekes, Ryan A</creator><creatorcontrib>Ghanem, Sally ; Panahi, Ashkan ; Krim, Hamid ; Kerekes, Ryan A</creatorcontrib><description>Robust Subspace Recovery (RoSuRe) algorithm was recently introduced as a principled and numerically efficient algorithm that unfolds underlying Unions of Subspaces (UoS) structure, present in the data. The union of Subspaces (UoS) is capable of identifying more complex trends in data sets than simple linear models. We build on and extend RoSuRe to prospect the structure of different data modalities individually. We propose a novel multi-modal data fusion approach based on group sparsity which we refer to as Robust Group Subspace Recovery (RoGSuRe). Relying on a bi-sparsity pursuit paradigm and non-smooth optimization techniques, the introduced framework learns a new joint representation of the time series from different data modalities, respecting an underlying UoS model. We subsequently integrate the obtained structures to form a unified subspace structure. The proposed approach exploits the structural dependencies between the different modalities data to cluster the associated target objects. The resulting fusion of the unlabeled sensors' data from experiments on audio and magnetic data has shown that our method is competitive with other state of the art subspace clustering methods. The resulting UoS structure is employed to classify newly observed data points, highlighting the abstraction capacity of the proposed method.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2006.10657</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Audio data ; Clustering ; Computer Science - Learning ; Data integration ; Data points ; Modal data ; Object recognition ; Optimization ; Optimization techniques ; Robustness (mathematics) ; Sparsity ; Statistics - Machine Learning ; Subspace methods ; Subspaces</subject><ispartof>arXiv.org, 2020-06</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,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.1109/JSEN.2020.2999461$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2006.10657$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Ghanem, Sally</creatorcontrib><creatorcontrib>Panahi, Ashkan</creatorcontrib><creatorcontrib>Krim, Hamid</creatorcontrib><creatorcontrib>Kerekes, Ryan A</creatorcontrib><title>Robust Group Subspace Recovery: A New Approach for Multi-Modality Data Fusion</title><title>arXiv.org</title><description>Robust Subspace Recovery (RoSuRe) algorithm was recently introduced as a principled and numerically efficient algorithm that unfolds underlying Unions of Subspaces (UoS) structure, present in the data. The union of Subspaces (UoS) is capable of identifying more complex trends in data sets than simple linear models. We build on and extend RoSuRe to prospect the structure of different data modalities individually. We propose a novel multi-modal data fusion approach based on group sparsity which we refer to as Robust Group Subspace Recovery (RoGSuRe). Relying on a bi-sparsity pursuit paradigm and non-smooth optimization techniques, the introduced framework learns a new joint representation of the time series from different data modalities, respecting an underlying UoS model. We subsequently integrate the obtained structures to form a unified subspace structure. The proposed approach exploits the structural dependencies between the different modalities data to cluster the associated target objects. The resulting fusion of the unlabeled sensors' data from experiments on audio and magnetic data has shown that our method is competitive with other state of the art subspace clustering methods. The resulting UoS structure is employed to classify newly observed data points, highlighting the abstraction capacity of the proposed method.</description><subject>Algorithms</subject><subject>Audio data</subject><subject>Clustering</subject><subject>Computer Science - Learning</subject><subject>Data integration</subject><subject>Data points</subject><subject>Modal data</subject><subject>Object recognition</subject><subject>Optimization</subject><subject>Optimization techniques</subject><subject>Robustness (mathematics)</subject><subject>Sparsity</subject><subject>Statistics - Machine Learning</subject><subject>Subspace methods</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>eNotj81OAjEYRRsTEwnyAK5s4nrw6--07ggKmoAmyH7STkscgnRspyhv7wiu7ubk5hyEbgiMuRIC7k38aQ5jCiDHBKQoL9CAMkYKxSm9QqOUtgBAZUmFYAO0XAWbU4fnMeQWv2ebWlN7vPJ1OPh4fMAT_Oq_8aRtYzD1B96EiJd51zXFMjiza7ojfjSdwbOcmrC_Rpcbs0t-9L9DtJ49rafPxeJt_jKdLAojqCq009qBs7Ym3AtZWgnCE1CKOcmdE4KrkglLYKPAltpwrSU4ImlfY7T3bIhuz7en1qqNzaeJx-qvuTo198Tdmei1v7JPXbUNOe57p4pywjVoUir2CyGpV-A</recordid><startdate>20200618</startdate><enddate>20200618</enddate><creator>Ghanem, Sally</creator><creator>Panahi, Ashkan</creator><creator>Krim, Hamid</creator><creator>Kerekes, Ryan A</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>20200618</creationdate><title>Robust Group Subspace Recovery: A New Approach for Multi-Modality Data Fusion</title><author>Ghanem, Sally ; Panahi, Ashkan ; Krim, Hamid ; Kerekes, Ryan A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a528-9d99d0dbbc14e567b605e10883d64dd5548735b10f80b79a49960d162657a9ee3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Audio data</topic><topic>Clustering</topic><topic>Computer Science - Learning</topic><topic>Data integration</topic><topic>Data points</topic><topic>Modal data</topic><topic>Object recognition</topic><topic>Optimization</topic><topic>Optimization techniques</topic><topic>Robustness (mathematics)</topic><topic>Sparsity</topic><topic>Statistics - Machine Learning</topic><topic>Subspace methods</topic><topic>Subspaces</topic><toplevel>online_resources</toplevel><creatorcontrib>Ghanem, Sally</creatorcontrib><creatorcontrib>Panahi, Ashkan</creatorcontrib><creatorcontrib>Krim, Hamid</creatorcontrib><creatorcontrib>Kerekes, Ryan A</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>Access via ProQuest (Open Access)</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>Ghanem, Sally</au><au>Panahi, Ashkan</au><au>Krim, Hamid</au><au>Kerekes, Ryan A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Robust Group Subspace Recovery: A New Approach for Multi-Modality Data Fusion</atitle><jtitle>arXiv.org</jtitle><date>2020-06-18</date><risdate>2020</risdate><eissn>2331-8422</eissn><abstract>Robust Subspace Recovery (RoSuRe) algorithm was recently introduced as a principled and numerically efficient algorithm that unfolds underlying Unions of Subspaces (UoS) structure, present in the data. The union of Subspaces (UoS) is capable of identifying more complex trends in data sets than simple linear models. We build on and extend RoSuRe to prospect the structure of different data modalities individually. We propose a novel multi-modal data fusion approach based on group sparsity which we refer to as Robust Group Subspace Recovery (RoGSuRe). Relying on a bi-sparsity pursuit paradigm and non-smooth optimization techniques, the introduced framework learns a new joint representation of the time series from different data modalities, respecting an underlying UoS model. We subsequently integrate the obtained structures to form a unified subspace structure. The proposed approach exploits the structural dependencies between the different modalities data to cluster the associated target objects. The resulting fusion of the unlabeled sensors' data from experiments on audio and magnetic data has shown that our method is competitive with other state of the art subspace clustering methods. The resulting UoS structure is employed to classify newly observed data points, highlighting the abstraction capacity of the proposed method.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2006.10657</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2020-06 |
issn | 2331-8422 |
language | eng |
recordid | cdi_arxiv_primary_2006_10657 |
source | arXiv.org; Free E- Journals |
subjects | Algorithms Audio data Clustering Computer Science - Learning Data integration Data points Modal data Object recognition Optimization Optimization techniques Robustness (mathematics) Sparsity Statistics - Machine Learning Subspace methods Subspaces |
title | Robust Group Subspace Recovery: A New Approach for Multi-Modality Data Fusion |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T01%3A47%3A20IST&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=Robust%20Group%20Subspace%20Recovery:%20A%20New%20Approach%20for%20Multi-Modality%20Data%20Fusion&rft.jtitle=arXiv.org&rft.au=Ghanem,%20Sally&rft.date=2020-06-18&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2006.10657&rft_dat=%3Cproquest_arxiv%3E2414909178%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=2414909178&rft_id=info:pmid/&rfr_iscdi=true |