Structure-Aware Classification using Supervised Dictionary Learning
In this paper, we propose a supervised dictionary learning algorithm that aims to preserve the local geometry in both dimensions of the data. A graph-based regularization explicitly takes into account the local manifold structure of the data points. A second graph regularization gives similar treatm...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2016-09 |
---|---|
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 | Yankelevsky, Yael Elad, Michael |
description | In this paper, we propose a supervised dictionary learning algorithm that aims to preserve the local geometry in both dimensions of the data. A graph-based regularization explicitly takes into account the local manifold structure of the data points. A second graph regularization gives similar treatment to the feature domain and helps in learning a more robust dictionary. Both graphs can be constructed from the training data or learned and adapted along the dictionary learning process. The combination of these two terms promotes the discriminative power of the learned sparse representations and leads to improved classification accuracy. The proposed method was evaluated on several different datasets, representing both single-label and multi-label classification problems, and demonstrated better performance compared with other dictionary based approaches. |
doi_str_mv | 10.48550/arxiv.1609.09199 |
format | Article |
fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1609_09199</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2073991735</sourcerecordid><originalsourceid>FETCH-LOGICAL-a525-9cdd7729a34f45ac6aa52ac57e6268cb41c3fe10eacda026c3696ceacbd0da7b3</originalsourceid><addsrcrecordid>eNotj8tqwzAQRUWh0JDmA7qqoWu7eliStQzuIwVDF8nejCW5KKS2K1lp-_dVkq6GmXsZzkHojuCirDjHj-B_3LEgAqsCK6LUFVpQxkhelZTeoFUIe4wxFZJyzhao3s4-6jl6m6-_wdusPkAIrncaZjcOWQxu-Mi2cbL-6II12ZPTpwD8b9ZY8EOKb9F1D4dgV_9ziXYvz7t6kzfvr2_1usmBU54rbYyUVAEr-5KDFpDOoLm0gopKdyXRrLcEW9AGEqBmQgmdts5gA7JjS3R_eXs2bCfvPhNFezJtz6ap8XBpTH78ijbM7X6MfkhMLcWSKUUk4-wPRopYAw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2073991735</pqid></control><display><type>article</type><title>Structure-Aware Classification using Supervised Dictionary Learning</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Yankelevsky, Yael ; Elad, Michael</creator><creatorcontrib>Yankelevsky, Yael ; Elad, Michael</creatorcontrib><description>In this paper, we propose a supervised dictionary learning algorithm that aims to preserve the local geometry in both dimensions of the data. A graph-based regularization explicitly takes into account the local manifold structure of the data points. A second graph regularization gives similar treatment to the feature domain and helps in learning a more robust dictionary. Both graphs can be constructed from the training data or learned and adapted along the dictionary learning process. The combination of these two terms promotes the discriminative power of the learned sparse representations and leads to improved classification accuracy. The proposed method was evaluated on several different datasets, representing both single-label and multi-label classification problems, and demonstrated better performance compared with other dictionary based approaches.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1609.09199</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Classification ; Computer Science - Computer Vision and Pattern Recognition ; Computer Science - Learning ; Data points ; Dictionaries ; Machine learning ; Regularization</subject><ispartof>arXiv.org, 2016-09</ispartof><rights>2016. 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,27924</link.rule.ids><backlink>$$Uhttps://doi.org/10.1109/ICASSP.2017.7952992$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.1609.09199$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Yankelevsky, Yael</creatorcontrib><creatorcontrib>Elad, Michael</creatorcontrib><title>Structure-Aware Classification using Supervised Dictionary Learning</title><title>arXiv.org</title><description>In this paper, we propose a supervised dictionary learning algorithm that aims to preserve the local geometry in both dimensions of the data. A graph-based regularization explicitly takes into account the local manifold structure of the data points. A second graph regularization gives similar treatment to the feature domain and helps in learning a more robust dictionary. Both graphs can be constructed from the training data or learned and adapted along the dictionary learning process. The combination of these two terms promotes the discriminative power of the learned sparse representations and leads to improved classification accuracy. The proposed method was evaluated on several different datasets, representing both single-label and multi-label classification problems, and demonstrated better performance compared with other dictionary based approaches.</description><subject>Algorithms</subject><subject>Classification</subject><subject>Computer Science - Computer Vision and Pattern Recognition</subject><subject>Computer Science - Learning</subject><subject>Data points</subject><subject>Dictionaries</subject><subject>Machine learning</subject><subject>Regularization</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</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>eNotj8tqwzAQRUWh0JDmA7qqoWu7eliStQzuIwVDF8nejCW5KKS2K1lp-_dVkq6GmXsZzkHojuCirDjHj-B_3LEgAqsCK6LUFVpQxkhelZTeoFUIe4wxFZJyzhao3s4-6jl6m6-_wdusPkAIrncaZjcOWQxu-Mi2cbL-6II12ZPTpwD8b9ZY8EOKb9F1D4dgV_9ziXYvz7t6kzfvr2_1usmBU54rbYyUVAEr-5KDFpDOoLm0gopKdyXRrLcEW9AGEqBmQgmdts5gA7JjS3R_eXs2bCfvPhNFezJtz6ap8XBpTH78ijbM7X6MfkhMLcWSKUUk4-wPRopYAw</recordid><startdate>20160929</startdate><enddate>20160929</enddate><creator>Yankelevsky, Yael</creator><creator>Elad, Michael</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>GOX</scope></search><sort><creationdate>20160929</creationdate><title>Structure-Aware Classification using Supervised Dictionary Learning</title><author>Yankelevsky, Yael ; Elad, Michael</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a525-9cdd7729a34f45ac6aa52ac57e6268cb41c3fe10eacda026c3696ceacbd0da7b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Classification</topic><topic>Computer Science - Computer Vision and Pattern Recognition</topic><topic>Computer Science - Learning</topic><topic>Data points</topic><topic>Dictionaries</topic><topic>Machine learning</topic><topic>Regularization</topic><toplevel>online_resources</toplevel><creatorcontrib>Yankelevsky, Yael</creatorcontrib><creatorcontrib>Elad, Michael</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.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yankelevsky, Yael</au><au>Elad, Michael</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Structure-Aware Classification using Supervised Dictionary Learning</atitle><jtitle>arXiv.org</jtitle><date>2016-09-29</date><risdate>2016</risdate><eissn>2331-8422</eissn><abstract>In this paper, we propose a supervised dictionary learning algorithm that aims to preserve the local geometry in both dimensions of the data. A graph-based regularization explicitly takes into account the local manifold structure of the data points. A second graph regularization gives similar treatment to the feature domain and helps in learning a more robust dictionary. Both graphs can be constructed from the training data or learned and adapted along the dictionary learning process. The combination of these two terms promotes the discriminative power of the learned sparse representations and leads to improved classification accuracy. The proposed method was evaluated on several different datasets, representing both single-label and multi-label classification problems, and demonstrated better performance compared with other dictionary based approaches.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1609.09199</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2016-09 |
issn | 2331-8422 |
language | eng |
recordid | cdi_arxiv_primary_1609_09199 |
source | arXiv.org; Free E- Journals |
subjects | Algorithms Classification Computer Science - Computer Vision and Pattern Recognition Computer Science - Learning Data points Dictionaries Machine learning Regularization |
title | Structure-Aware Classification using Supervised Dictionary Learning |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T20%3A11%3A10IST&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=Structure-Aware%20Classification%20using%20Supervised%20Dictionary%20Learning&rft.jtitle=arXiv.org&rft.au=Yankelevsky,%20Yael&rft.date=2016-09-29&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1609.09199&rft_dat=%3Cproquest_arxiv%3E2073991735%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=2073991735&rft_id=info:pmid/&rfr_iscdi=true |