Semisupervised Feature Analysis by Mining Correlations Among Multiple Tasks
In this paper, we propose a novel semisupervised feature selection framework by mining correlations among multiple tasks and apply it to different multimedia applications. Instead of independently computing the importance of features for each task, our algorithm leverages shared knowledge from multi...
Gespeichert in:
Veröffentlicht in: | IEEE transaction on neural networks and learning systems 2017-10, Vol.28 (10), p.2294-2305 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 2305 |
---|---|
container_issue | 10 |
container_start_page | 2294 |
container_title | IEEE transaction on neural networks and learning systems |
container_volume | 28 |
creator | Chang, Xiaojun Yang, Yi |
description | In this paper, we propose a novel semisupervised feature selection framework by mining correlations among multiple tasks and apply it to different multimedia applications. Instead of independently computing the importance of features for each task, our algorithm leverages shared knowledge from multiple related tasks, thus improving the performance of feature selection. Note that the proposed algorithm is built upon an assumption that different tasks share some common structures. The proposed algorithm selects features in a batch mode, by which the correlations between various features are taken into consideration. Besides, considering the fact that labeling a large amount of training data in real world is both time-consuming and tedious, we adopt manifold learning, which exploits both labeled and unlabeled training data for a feature space analysis. Since the objective function is nonsmooth and difficult to solve, we propose an iteractive algorithm with fast convergence. Extensive experiments on different applications demonstrate that our algorithm outperforms the other state-of-the-art feature selection algorithms. |
doi_str_mv | 10.1109/TNNLS.2016.2582746 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2174450545</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7506338</ieee_id><sourcerecordid>1826717198</sourcerecordid><originalsourceid>FETCH-LOGICAL-c395t-f3da5a1050e853120c21600ba476b761ae6db6efb86105d11c6a056d75b5334c3</originalsourceid><addsrcrecordid>eNpdkFFPwjAQgBujEYP8AU3MEl98AXvt2o5HQkSNgA9g4lvTbYcpjm22mwn_3iLIg3255u67y91HyBXQAQAd3i_n8-liwCjIARMJU7E8IRcMJOszniSnx79675Ce92sanqRCxsNz0gk4AOP0grwscGN9W6P7th7zaIKmaR1Go9IUW299lG6jmS1t-RGNK-ewMI2tSh-NNlVIzdqisXWB0dL4T39Jzlam8Ng7xC55mzwsx0_96evj83g07Wd8KJr-iudGGKCCYiI4MJqFVSlNTaxkqiQYlHkqcZUmMkA5QCZNWDxXIhWcxxnvkrv93NpVXy36RocTMiwKU2LVeg0JkwoUDJOA3v5D11Xrwm1eM1BxLKiIRaDYnspc5b3Dla6d3Ri31UD1zrb-ta13tvXBdmi6OYxu0w3mx5Y_twG43gMWEY9lJajkPOE_BfCCDw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2174450545</pqid></control><display><type>article</type><title>Semisupervised Feature Analysis by Mining Correlations Among Multiple Tasks</title><source>IEEE Electronic Library (IEL)</source><creator>Chang, Xiaojun ; Yang, Yi</creator><creatorcontrib>Chang, Xiaojun ; Yang, Yi</creatorcontrib><description>In this paper, we propose a novel semisupervised feature selection framework by mining correlations among multiple tasks and apply it to different multimedia applications. Instead of independently computing the importance of features for each task, our algorithm leverages shared knowledge from multiple related tasks, thus improving the performance of feature selection. Note that the proposed algorithm is built upon an assumption that different tasks share some common structures. The proposed algorithm selects features in a batch mode, by which the correlations between various features are taken into consideration. Besides, considering the fact that labeling a large amount of training data in real world is both time-consuming and tedious, we adopt manifold learning, which exploits both labeled and unlabeled training data for a feature space analysis. Since the objective function is nonsmooth and difficult to solve, we propose an iteractive algorithm with fast convergence. Extensive experiments on different applications demonstrate that our algorithm outperforms the other state-of-the-art feature selection algorithms.</description><identifier>ISSN: 2162-237X</identifier><identifier>EISSN: 2162-2388</identifier><identifier>DOI: 10.1109/TNNLS.2016.2582746</identifier><identifier>PMID: 27411230</identifier><identifier>CODEN: ITNNAL</identifier><language>eng</language><publisher>United States: IEEE</publisher><subject>3-D motion data analysis ; Algorithm design and analysis ; Algorithms ; Correlation ; Correlation analysis ; Data mining ; gene pattern recognition ; image annotation ; Machine learning ; Manifolds ; Manifolds (mathematics) ; Multimedia ; Multimedia communication ; multitask feature selection ; Objective function ; Semisupervised learning ; State of the art ; Training ; Training data</subject><ispartof>IEEE transaction on neural networks and learning systems, 2017-10, Vol.28 (10), p.2294-2305</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c395t-f3da5a1050e853120c21600ba476b761ae6db6efb86105d11c6a056d75b5334c3</citedby><cites>FETCH-LOGICAL-c395t-f3da5a1050e853120c21600ba476b761ae6db6efb86105d11c6a056d75b5334c3</cites><orcidid>0000-0002-7778-8807</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7506338$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7506338$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/27411230$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Chang, Xiaojun</creatorcontrib><creatorcontrib>Yang, Yi</creatorcontrib><title>Semisupervised Feature Analysis by Mining Correlations Among Multiple Tasks</title><title>IEEE transaction on neural networks and learning systems</title><addtitle>TNNLS</addtitle><addtitle>IEEE Trans Neural Netw Learn Syst</addtitle><description>In this paper, we propose a novel semisupervised feature selection framework by mining correlations among multiple tasks and apply it to different multimedia applications. Instead of independently computing the importance of features for each task, our algorithm leverages shared knowledge from multiple related tasks, thus improving the performance of feature selection. Note that the proposed algorithm is built upon an assumption that different tasks share some common structures. The proposed algorithm selects features in a batch mode, by which the correlations between various features are taken into consideration. Besides, considering the fact that labeling a large amount of training data in real world is both time-consuming and tedious, we adopt manifold learning, which exploits both labeled and unlabeled training data for a feature space analysis. Since the objective function is nonsmooth and difficult to solve, we propose an iteractive algorithm with fast convergence. Extensive experiments on different applications demonstrate that our algorithm outperforms the other state-of-the-art feature selection algorithms.</description><subject>3-D motion data analysis</subject><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Correlation</subject><subject>Correlation analysis</subject><subject>Data mining</subject><subject>gene pattern recognition</subject><subject>image annotation</subject><subject>Machine learning</subject><subject>Manifolds</subject><subject>Manifolds (mathematics)</subject><subject>Multimedia</subject><subject>Multimedia communication</subject><subject>multitask feature selection</subject><subject>Objective function</subject><subject>Semisupervised learning</subject><subject>State of the art</subject><subject>Training</subject><subject>Training data</subject><issn>2162-237X</issn><issn>2162-2388</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkFFPwjAQgBujEYP8AU3MEl98AXvt2o5HQkSNgA9g4lvTbYcpjm22mwn_3iLIg3255u67y91HyBXQAQAd3i_n8-liwCjIARMJU7E8IRcMJOszniSnx79675Ce92sanqRCxsNz0gk4AOP0grwscGN9W6P7th7zaIKmaR1Go9IUW299lG6jmS1t-RGNK-ewMI2tSh-NNlVIzdqisXWB0dL4T39Jzlam8Ng7xC55mzwsx0_96evj83g07Wd8KJr-iudGGKCCYiI4MJqFVSlNTaxkqiQYlHkqcZUmMkA5QCZNWDxXIhWcxxnvkrv93NpVXy36RocTMiwKU2LVeg0JkwoUDJOA3v5D11Xrwm1eM1BxLKiIRaDYnspc5b3Dla6d3Ri31UD1zrb-ta13tvXBdmi6OYxu0w3mx5Y_twG43gMWEY9lJajkPOE_BfCCDw</recordid><startdate>20171001</startdate><enddate>20171001</enddate><creator>Chang, Xiaojun</creator><creator>Yang, Yi</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7QF</scope><scope>7QO</scope><scope>7QP</scope><scope>7QQ</scope><scope>7QR</scope><scope>7SC</scope><scope>7SE</scope><scope>7SP</scope><scope>7SR</scope><scope>7TA</scope><scope>7TB</scope><scope>7TK</scope><scope>7U5</scope><scope>8BQ</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>H8D</scope><scope>JG9</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>P64</scope><scope>7X8</scope><orcidid>https://orcid.org/0000-0002-7778-8807</orcidid></search><sort><creationdate>20171001</creationdate><title>Semisupervised Feature Analysis by Mining Correlations Among Multiple Tasks</title><author>Chang, Xiaojun ; Yang, Yi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c395t-f3da5a1050e853120c21600ba476b761ae6db6efb86105d11c6a056d75b5334c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>3-D motion data analysis</topic><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Correlation</topic><topic>Correlation analysis</topic><topic>Data mining</topic><topic>gene pattern recognition</topic><topic>image annotation</topic><topic>Machine learning</topic><topic>Manifolds</topic><topic>Manifolds (mathematics)</topic><topic>Multimedia</topic><topic>Multimedia communication</topic><topic>multitask feature selection</topic><topic>Objective function</topic><topic>Semisupervised learning</topic><topic>State of the art</topic><topic>Training</topic><topic>Training data</topic><toplevel>online_resources</toplevel><creatorcontrib>Chang, Xiaojun</creatorcontrib><creatorcontrib>Yang, Yi</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Aluminium Industry Abstracts</collection><collection>Biotechnology Research Abstracts</collection><collection>Calcium & Calcified Tissue Abstracts</collection><collection>Ceramic Abstracts</collection><collection>Chemoreception Abstracts</collection><collection>Computer and Information Systems Abstracts</collection><collection>Corrosion Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Neurosciences Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>MEDLINE - Academic</collection><jtitle>IEEE transaction on neural networks and learning systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chang, Xiaojun</au><au>Yang, Yi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Semisupervised Feature Analysis by Mining Correlations Among Multiple Tasks</atitle><jtitle>IEEE transaction on neural networks and learning systems</jtitle><stitle>TNNLS</stitle><addtitle>IEEE Trans Neural Netw Learn Syst</addtitle><date>2017-10-01</date><risdate>2017</risdate><volume>28</volume><issue>10</issue><spage>2294</spage><epage>2305</epage><pages>2294-2305</pages><issn>2162-237X</issn><eissn>2162-2388</eissn><coden>ITNNAL</coden><abstract>In this paper, we propose a novel semisupervised feature selection framework by mining correlations among multiple tasks and apply it to different multimedia applications. Instead of independently computing the importance of features for each task, our algorithm leverages shared knowledge from multiple related tasks, thus improving the performance of feature selection. Note that the proposed algorithm is built upon an assumption that different tasks share some common structures. The proposed algorithm selects features in a batch mode, by which the correlations between various features are taken into consideration. Besides, considering the fact that labeling a large amount of training data in real world is both time-consuming and tedious, we adopt manifold learning, which exploits both labeled and unlabeled training data for a feature space analysis. Since the objective function is nonsmooth and difficult to solve, we propose an iteractive algorithm with fast convergence. Extensive experiments on different applications demonstrate that our algorithm outperforms the other state-of-the-art feature selection algorithms.</abstract><cop>United States</cop><pub>IEEE</pub><pmid>27411230</pmid><doi>10.1109/TNNLS.2016.2582746</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0002-7778-8807</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2162-237X |
ispartof | IEEE transaction on neural networks and learning systems, 2017-10, Vol.28 (10), p.2294-2305 |
issn | 2162-237X 2162-2388 |
language | eng |
recordid | cdi_proquest_journals_2174450545 |
source | IEEE Electronic Library (IEL) |
subjects | 3-D motion data analysis Algorithm design and analysis Algorithms Correlation Correlation analysis Data mining gene pattern recognition image annotation Machine learning Manifolds Manifolds (mathematics) Multimedia Multimedia communication multitask feature selection Objective function Semisupervised learning State of the art Training Training data |
title | Semisupervised Feature Analysis by Mining Correlations Among Multiple Tasks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T04%3A00%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Semisupervised%20Feature%20Analysis%20by%20Mining%20Correlations%20Among%20Multiple%20Tasks&rft.jtitle=IEEE%20transaction%20on%20neural%20networks%20and%20learning%20systems&rft.au=Chang,%20Xiaojun&rft.date=2017-10-01&rft.volume=28&rft.issue=10&rft.spage=2294&rft.epage=2305&rft.pages=2294-2305&rft.issn=2162-237X&rft.eissn=2162-2388&rft.coden=ITNNAL&rft_id=info:doi/10.1109/TNNLS.2016.2582746&rft_dat=%3Cproquest_RIE%3E1826717198%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2174450545&rft_id=info:pmid/27411230&rft_ieee_id=7506338&rfr_iscdi=true |