A metaheuristic multi-objective interaction-aware feature selection method

Multi-objective feature selection is one of the most significant issues in the field of pattern recognition. It is challenging because it maximizes the classification performance and, at the same time, minimizes the number of selected features, and the mentioned two objectives are usually conflictin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Namakin, Motahare, Rouhani, Modjtaba, Sabzekar, Mostafa
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
container_issue
container_start_page
container_title
container_volume
creator Namakin, Motahare
Rouhani, Modjtaba
Sabzekar, Mostafa
description Multi-objective feature selection is one of the most significant issues in the field of pattern recognition. It is challenging because it maximizes the classification performance and, at the same time, minimizes the number of selected features, and the mentioned two objectives are usually conflicting. To achieve a better Pareto optimal solution, metaheuristic optimization methods are widely used in many studies. However, the main drawback is the exploration of a large search space. Another problem with multi-objective feature selection approaches is the interaction between features. Selecting correlated features has negative effect on classification performance. To tackle these problems, we present a novel multi-objective feature selection method that has several advantages. Firstly, it considers the interaction between features using an advanced probability scheme. Secondly, it is based on the Pareto Archived Evolution Strategy (PAES) method that has several advantages such as simplicity and its speed in exploring the solution space. However, we improve the structure of PAES in such a way that generates the offsprings, intelligently. Thus, the proposed method utilizes the introduced probability scheme to produce more promising offsprings. Finally, it is equipped with a novel strategy that guides it to find the optimum number of features through the process of evolution. The experimental results show a significant improvement in finding the optimal Pareto front compared to state-of-the-art methods on different real-world datasets.
doi_str_mv 10.48550/arxiv.2211.05423
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2211_05423</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2211_05423</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-572b0b91f09455d44d9e7745ff727012cb2dea1629b40ce558e670a42437e9823</originalsourceid><addsrcrecordid>eNotj71OwzAURr0woJYHYCIv4GBf23E8VhW_qsTSPbpOrlVXSYMcp8Db0wam8-kbjnQYu5ei1LUx4hHTdzyXAFKWwmhQt-x9UwyU8UBzilOObTHMfY589EdqczxTEU-ZEl72eOL4hYmKQJjnCyfqafmvhsPYrdlNwH6iu3-u2P75ab995buPl7ftZsexsoobC154J4Nw2phO686RtdqEYMEKCa2HjlBW4LwWLRlTU2UFatDKkqtBrdjDn3aJaT5THDD9NNeoZolSv7ZjR3A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A metaheuristic multi-objective interaction-aware feature selection method</title><source>arXiv.org</source><creator>Namakin, Motahare ; Rouhani, Modjtaba ; Sabzekar, Mostafa</creator><creatorcontrib>Namakin, Motahare ; Rouhani, Modjtaba ; Sabzekar, Mostafa</creatorcontrib><description>Multi-objective feature selection is one of the most significant issues in the field of pattern recognition. It is challenging because it maximizes the classification performance and, at the same time, minimizes the number of selected features, and the mentioned two objectives are usually conflicting. To achieve a better Pareto optimal solution, metaheuristic optimization methods are widely used in many studies. However, the main drawback is the exploration of a large search space. Another problem with multi-objective feature selection approaches is the interaction between features. Selecting correlated features has negative effect on classification performance. To tackle these problems, we present a novel multi-objective feature selection method that has several advantages. Firstly, it considers the interaction between features using an advanced probability scheme. Secondly, it is based on the Pareto Archived Evolution Strategy (PAES) method that has several advantages such as simplicity and its speed in exploring the solution space. However, we improve the structure of PAES in such a way that generates the offsprings, intelligently. Thus, the proposed method utilizes the introduced probability scheme to produce more promising offsprings. Finally, it is equipped with a novel strategy that guides it to find the optimum number of features through the process of evolution. The experimental results show a significant improvement in finding the optimal Pareto front compared to state-of-the-art methods on different real-world datasets.</description><identifier>DOI: 10.48550/arxiv.2211.05423</identifier><language>eng</language><subject>Computer Science - Artificial Intelligence</subject><creationdate>2022-11</creationdate><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,778,883</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2211.05423$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2211.05423$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Namakin, Motahare</creatorcontrib><creatorcontrib>Rouhani, Modjtaba</creatorcontrib><creatorcontrib>Sabzekar, Mostafa</creatorcontrib><title>A metaheuristic multi-objective interaction-aware feature selection method</title><description>Multi-objective feature selection is one of the most significant issues in the field of pattern recognition. It is challenging because it maximizes the classification performance and, at the same time, minimizes the number of selected features, and the mentioned two objectives are usually conflicting. To achieve a better Pareto optimal solution, metaheuristic optimization methods are widely used in many studies. However, the main drawback is the exploration of a large search space. Another problem with multi-objective feature selection approaches is the interaction between features. Selecting correlated features has negative effect on classification performance. To tackle these problems, we present a novel multi-objective feature selection method that has several advantages. Firstly, it considers the interaction between features using an advanced probability scheme. Secondly, it is based on the Pareto Archived Evolution Strategy (PAES) method that has several advantages such as simplicity and its speed in exploring the solution space. However, we improve the structure of PAES in such a way that generates the offsprings, intelligently. Thus, the proposed method utilizes the introduced probability scheme to produce more promising offsprings. Finally, it is equipped with a novel strategy that guides it to find the optimum number of features through the process of evolution. The experimental results show a significant improvement in finding the optimal Pareto front compared to state-of-the-art methods on different real-world datasets.</description><subject>Computer Science - Artificial Intelligence</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71OwzAURr0woJYHYCIv4GBf23E8VhW_qsTSPbpOrlVXSYMcp8Db0wam8-kbjnQYu5ei1LUx4hHTdzyXAFKWwmhQt-x9UwyU8UBzilOObTHMfY589EdqczxTEU-ZEl72eOL4hYmKQJjnCyfqafmvhsPYrdlNwH6iu3-u2P75ab995buPl7ftZsexsoobC154J4Nw2phO686RtdqEYMEKCa2HjlBW4LwWLRlTU2UFatDKkqtBrdjDn3aJaT5THDD9NNeoZolSv7ZjR3A</recordid><startdate>20221110</startdate><enddate>20221110</enddate><creator>Namakin, Motahare</creator><creator>Rouhani, Modjtaba</creator><creator>Sabzekar, Mostafa</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20221110</creationdate><title>A metaheuristic multi-objective interaction-aware feature selection method</title><author>Namakin, Motahare ; Rouhani, Modjtaba ; Sabzekar, Mostafa</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-572b0b91f09455d44d9e7745ff727012cb2dea1629b40ce558e670a42437e9823</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Artificial Intelligence</topic><toplevel>online_resources</toplevel><creatorcontrib>Namakin, Motahare</creatorcontrib><creatorcontrib>Rouhani, Modjtaba</creatorcontrib><creatorcontrib>Sabzekar, Mostafa</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Namakin, Motahare</au><au>Rouhani, Modjtaba</au><au>Sabzekar, Mostafa</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A metaheuristic multi-objective interaction-aware feature selection method</atitle><date>2022-11-10</date><risdate>2022</risdate><abstract>Multi-objective feature selection is one of the most significant issues in the field of pattern recognition. It is challenging because it maximizes the classification performance and, at the same time, minimizes the number of selected features, and the mentioned two objectives are usually conflicting. To achieve a better Pareto optimal solution, metaheuristic optimization methods are widely used in many studies. However, the main drawback is the exploration of a large search space. Another problem with multi-objective feature selection approaches is the interaction between features. Selecting correlated features has negative effect on classification performance. To tackle these problems, we present a novel multi-objective feature selection method that has several advantages. Firstly, it considers the interaction between features using an advanced probability scheme. Secondly, it is based on the Pareto Archived Evolution Strategy (PAES) method that has several advantages such as simplicity and its speed in exploring the solution space. However, we improve the structure of PAES in such a way that generates the offsprings, intelligently. Thus, the proposed method utilizes the introduced probability scheme to produce more promising offsprings. Finally, it is equipped with a novel strategy that guides it to find the optimum number of features through the process of evolution. The experimental results show a significant improvement in finding the optimal Pareto front compared to state-of-the-art methods on different real-world datasets.</abstract><doi>10.48550/arxiv.2211.05423</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2211.05423
ispartof
issn
language eng
recordid cdi_arxiv_primary_2211_05423
source arXiv.org
subjects Computer Science - Artificial Intelligence
title A metaheuristic multi-objective interaction-aware feature selection method
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T14%3A49%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20metaheuristic%20multi-objective%20interaction-aware%20feature%20selection%20method&rft.au=Namakin,%20Motahare&rft.date=2022-11-10&rft_id=info:doi/10.48550/arxiv.2211.05423&rft_dat=%3Carxiv_GOX%3E2211_05423%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true