Particle ranking: An Efficient Method for Multi-Objective Particle Swarm Optimization Feature Selection
This paper presents a novel multi-objective particle swarm optimization feature selection method. For this task, feature vectors are decoded as particles and ranked in a two-dimensional optimization space. To rank a particle, optimization space is modeled as two bands of dominated and non dominated...
Gespeichert in:
Veröffentlicht in: | Knowledge-based systems 2022-06, Vol.245, p.108640, Article 108640 |
---|---|
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 | 108640 |
container_title | Knowledge-based systems |
container_volume | 245 |
creator | Rashno, Abdolreza Shafipour, Milad Fadaei, Sadegh |
description | This paper presents a novel multi-objective particle swarm optimization feature selection method. For this task, feature vectors are decoded as particles and ranked in a two-dimensional optimization space. To rank a particle, optimization space is modeled as two bands of dominated and non dominated particles with respect to that particle. Furthermore, uniform and nonuniform distributions of particles in optimization space as well as main properties of the proposed model are analyzed mathematically and experimentally in details. Beside particle ranks, feature ranks are also used to update velocity and position of particles in each iteration of optimization process.The proposed method has been evaluated in 16 datasets and compared with 11 state of the art feature selection and multi-objective optimization methods. Visual experimental results show that the proposed method finds Pareto Fronts of the best particles close to origin in multi-objective optimization space. Quantitative experiments also show that the proposed method achieves: the best Success Counting Measure in 13 datasets, superior C-Metric in 14 datasets, the greatest Hyper-Volume Indicator in 13 datasets. Finally, results of pairwise Mann–Whitney U-test show that the proposed method is statistically better in 38 pairwise statistically tests out of 55 tests. |
doi_str_mv | 10.1016/j.knosys.2022.108640 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2667854260</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S095070512200288X</els_id><sourcerecordid>2667854260</sourcerecordid><originalsourceid>FETCH-LOGICAL-c264t-fb09448c175474366926889b25fd5caea0ad0ae8d65023b0b0aa742f89b8d76b3</originalsourceid><addsrcrecordid>eNp9kFFLwzAQx4MoOKffwIeAz53XLE1TH4QxnAobE9TnkLbpTNc1M0kn89ObUvHRp4O73_-O-yF0HcMkhpjd1pNta9zRTQgQElqcUThBo5inJEopZKdoBFkCUQpJfI4unKsBAhnzEdq8SOt10ShsZbvV7eYOz1r8UFW60Kr1eKX8hylxZSxedY3X0TqvVeH1QeG_5OuXtDu83nu909_Sa9PihZK-s2Gkmp427SU6q2Tj1NVvHaP3xcPb_Clarh-f57NlVBBGfVTlkFHKizhNaEqnjGWEcZ7lJKnKpJBKgixBKl6yBMg0hxykTCmpAsLLlOXTMboZ9u6t-eyU86I2nW3DSUEYS3lCCYNA0YEqrHHOqkrsrd5JexQxiF6pqMWgVPRKxaA0xO6HmAofHLSywvWWClVqG94UpdH_L_gB0i6B5g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2667854260</pqid></control><display><type>article</type><title>Particle ranking: An Efficient Method for Multi-Objective Particle Swarm Optimization Feature Selection</title><source>Access via ScienceDirect (Elsevier)</source><creator>Rashno, Abdolreza ; Shafipour, Milad ; Fadaei, Sadegh</creator><creatorcontrib>Rashno, Abdolreza ; Shafipour, Milad ; Fadaei, Sadegh</creatorcontrib><description>This paper presents a novel multi-objective particle swarm optimization feature selection method. For this task, feature vectors are decoded as particles and ranked in a two-dimensional optimization space. To rank a particle, optimization space is modeled as two bands of dominated and non dominated particles with respect to that particle. Furthermore, uniform and nonuniform distributions of particles in optimization space as well as main properties of the proposed model are analyzed mathematically and experimentally in details. Beside particle ranks, feature ranks are also used to update velocity and position of particles in each iteration of optimization process.The proposed method has been evaluated in 16 datasets and compared with 11 state of the art feature selection and multi-objective optimization methods. Visual experimental results show that the proposed method finds Pareto Fronts of the best particles close to origin in multi-objective optimization space. Quantitative experiments also show that the proposed method achieves: the best Success Counting Measure in 13 datasets, superior C-Metric in 14 datasets, the greatest Hyper-Volume Indicator in 13 datasets. Finally, results of pairwise Mann–Whitney U-test show that the proposed method is statistically better in 38 pairwise statistically tests out of 55 tests.</description><identifier>ISSN: 0950-7051</identifier><identifier>EISSN: 1872-7409</identifier><identifier>DOI: 10.1016/j.knosys.2022.108640</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Datasets ; Feature ranking ; Feature selection ; Iterative methods ; Mathematical analysis ; Multi-objective optimization ; Multiple objective analysis ; Optimization ; Pareto optimization ; Particle ranking ; Particle swarm optimization ; Vectors (mathematics)</subject><ispartof>Knowledge-based systems, 2022-06, Vol.245, p.108640, Article 108640</ispartof><rights>2022 Elsevier B.V.</rights><rights>Copyright Elsevier Science Ltd. Jun 7, 2022</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c264t-fb09448c175474366926889b25fd5caea0ad0ae8d65023b0b0aa742f89b8d76b3</citedby><cites>FETCH-LOGICAL-c264t-fb09448c175474366926889b25fd5caea0ad0ae8d65023b0b0aa742f89b8d76b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.knosys.2022.108640$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Rashno, Abdolreza</creatorcontrib><creatorcontrib>Shafipour, Milad</creatorcontrib><creatorcontrib>Fadaei, Sadegh</creatorcontrib><title>Particle ranking: An Efficient Method for Multi-Objective Particle Swarm Optimization Feature Selection</title><title>Knowledge-based systems</title><description>This paper presents a novel multi-objective particle swarm optimization feature selection method. For this task, feature vectors are decoded as particles and ranked in a two-dimensional optimization space. To rank a particle, optimization space is modeled as two bands of dominated and non dominated particles with respect to that particle. Furthermore, uniform and nonuniform distributions of particles in optimization space as well as main properties of the proposed model are analyzed mathematically and experimentally in details. Beside particle ranks, feature ranks are also used to update velocity and position of particles in each iteration of optimization process.The proposed method has been evaluated in 16 datasets and compared with 11 state of the art feature selection and multi-objective optimization methods. Visual experimental results show that the proposed method finds Pareto Fronts of the best particles close to origin in multi-objective optimization space. Quantitative experiments also show that the proposed method achieves: the best Success Counting Measure in 13 datasets, superior C-Metric in 14 datasets, the greatest Hyper-Volume Indicator in 13 datasets. Finally, results of pairwise Mann–Whitney U-test show that the proposed method is statistically better in 38 pairwise statistically tests out of 55 tests.</description><subject>Datasets</subject><subject>Feature ranking</subject><subject>Feature selection</subject><subject>Iterative methods</subject><subject>Mathematical analysis</subject><subject>Multi-objective optimization</subject><subject>Multiple objective analysis</subject><subject>Optimization</subject><subject>Pareto optimization</subject><subject>Particle ranking</subject><subject>Particle swarm optimization</subject><subject>Vectors (mathematics)</subject><issn>0950-7051</issn><issn>1872-7409</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNp9kFFLwzAQx4MoOKffwIeAz53XLE1TH4QxnAobE9TnkLbpTNc1M0kn89ObUvHRp4O73_-O-yF0HcMkhpjd1pNta9zRTQgQElqcUThBo5inJEopZKdoBFkCUQpJfI4unKsBAhnzEdq8SOt10ShsZbvV7eYOz1r8UFW60Kr1eKX8hylxZSxedY3X0TqvVeH1QeG_5OuXtDu83nu909_Sa9PihZK-s2Gkmp427SU6q2Tj1NVvHaP3xcPb_Clarh-f57NlVBBGfVTlkFHKizhNaEqnjGWEcZ7lJKnKpJBKgixBKl6yBMg0hxykTCmpAsLLlOXTMboZ9u6t-eyU86I2nW3DSUEYS3lCCYNA0YEqrHHOqkrsrd5JexQxiF6pqMWgVPRKxaA0xO6HmAofHLSywvWWClVqG94UpdH_L_gB0i6B5g</recordid><startdate>20220607</startdate><enddate>20220607</enddate><creator>Rashno, Abdolreza</creator><creator>Shafipour, Milad</creator><creator>Fadaei, Sadegh</creator><general>Elsevier B.V</general><general>Elsevier Science Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20220607</creationdate><title>Particle ranking: An Efficient Method for Multi-Objective Particle Swarm Optimization Feature Selection</title><author>Rashno, Abdolreza ; Shafipour, Milad ; Fadaei, Sadegh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c264t-fb09448c175474366926889b25fd5caea0ad0ae8d65023b0b0aa742f89b8d76b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Datasets</topic><topic>Feature ranking</topic><topic>Feature selection</topic><topic>Iterative methods</topic><topic>Mathematical analysis</topic><topic>Multi-objective optimization</topic><topic>Multiple objective analysis</topic><topic>Optimization</topic><topic>Pareto optimization</topic><topic>Particle ranking</topic><topic>Particle swarm optimization</topic><topic>Vectors (mathematics)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rashno, Abdolreza</creatorcontrib><creatorcontrib>Shafipour, Milad</creatorcontrib><creatorcontrib>Fadaei, Sadegh</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Knowledge-based systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rashno, Abdolreza</au><au>Shafipour, Milad</au><au>Fadaei, Sadegh</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Particle ranking: An Efficient Method for Multi-Objective Particle Swarm Optimization Feature Selection</atitle><jtitle>Knowledge-based systems</jtitle><date>2022-06-07</date><risdate>2022</risdate><volume>245</volume><spage>108640</spage><pages>108640-</pages><artnum>108640</artnum><issn>0950-7051</issn><eissn>1872-7409</eissn><abstract>This paper presents a novel multi-objective particle swarm optimization feature selection method. For this task, feature vectors are decoded as particles and ranked in a two-dimensional optimization space. To rank a particle, optimization space is modeled as two bands of dominated and non dominated particles with respect to that particle. Furthermore, uniform and nonuniform distributions of particles in optimization space as well as main properties of the proposed model are analyzed mathematically and experimentally in details. Beside particle ranks, feature ranks are also used to update velocity and position of particles in each iteration of optimization process.The proposed method has been evaluated in 16 datasets and compared with 11 state of the art feature selection and multi-objective optimization methods. Visual experimental results show that the proposed method finds Pareto Fronts of the best particles close to origin in multi-objective optimization space. Quantitative experiments also show that the proposed method achieves: the best Success Counting Measure in 13 datasets, superior C-Metric in 14 datasets, the greatest Hyper-Volume Indicator in 13 datasets. Finally, results of pairwise Mann–Whitney U-test show that the proposed method is statistically better in 38 pairwise statistically tests out of 55 tests.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.knosys.2022.108640</doi></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0950-7051 |
ispartof | Knowledge-based systems, 2022-06, Vol.245, p.108640, Article 108640 |
issn | 0950-7051 1872-7409 |
language | eng |
recordid | cdi_proquest_journals_2667854260 |
source | Access via ScienceDirect (Elsevier) |
subjects | Datasets Feature ranking Feature selection Iterative methods Mathematical analysis Multi-objective optimization Multiple objective analysis Optimization Pareto optimization Particle ranking Particle swarm optimization Vectors (mathematics) |
title | Particle ranking: An Efficient Method for Multi-Objective Particle Swarm Optimization Feature Selection |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T00%3A49%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Particle%20ranking:%20An%20Efficient%20Method%20for%20Multi-Objective%20Particle%20Swarm%20Optimization%20Feature%20Selection&rft.jtitle=Knowledge-based%20systems&rft.au=Rashno,%20Abdolreza&rft.date=2022-06-07&rft.volume=245&rft.spage=108640&rft.pages=108640-&rft.artnum=108640&rft.issn=0950-7051&rft.eissn=1872-7409&rft_id=info:doi/10.1016/j.knosys.2022.108640&rft_dat=%3Cproquest_cross%3E2667854260%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2667854260&rft_id=info:pmid/&rft_els_id=S095070512200288X&rfr_iscdi=true |