Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection
Abstract The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burde...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Sharafi, Yousef [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2021 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Neural computing & applications - Springer London, 1993, 33(2021), 24 vom: 02. Aug., Seite 17497-17533 |
|---|---|
| Übergeordnetes Werk: |
volume:33 ; year:2021 ; number:24 ; day:02 ; month:08 ; pages:17497-17533 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00521-021-06340-9 |
|---|
| Katalog-ID: |
OLC2077367733 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2077367733 | ||
| 003 | DE-627 | ||
| 005 | 20230505144427.0 | ||
| 007 | tu | ||
| 008 | 221220s2021 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00521-021-06340-9 |2 doi | |
| 035 | |a (DE-627)OLC2077367733 | ||
| 035 | |a (DE-He213)s00521-021-06340-9-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 100 | 1 | |a Sharafi, Yousef |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection |
| 264 | 1 | |c 2021 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021 | ||
| 520 | |a Abstract The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burden through the elimination of unnecessary features. This paper was conducted to propose an opposition-based binary competitive optimization algorithm, namely OBCOOA, to solve the wrapper-based feature selection problems. The basic idea of the competitive optimization algorithm (COOA) lies on the natural competition between different species to survive, which is a continuous algorithm inherently. The present study entailed the main contributions as follows: primarily, a time-varying V-shape transfer function was used in the optimization process to present the binary version of the COOA algorithm, which established the right balance between the exploration and exploitation phases; secondly, in the proposed algorithm, the opposition-based learning mechanism was utilized to improve the diversity quality within the population members and to incorporate a suitable initial population. In the feature selection problem, the classification error rate and the number of selected features objective functions are usually adopted, which causes this problem to convert into a multi-objective optimization one. This research presented a single- and multi-objective approach from the proposed algorithm in order to solve the feature selection problem. The proposed algorithm was applied to 27 benchmark datasets, and the evaluation results were compared to the other well-known binary optimization algorithms. The experimental results indicated that the proposed algorithm has a better ability to find an optimal subset of features with the least classification error rate and the number of the selected features. | ||
| 650 | 4 | |a Feature selection | |
| 650 | 4 | |a Binary optimization | |
| 650 | 4 | |a Competitive optimization algorithm | |
| 650 | 4 | |a Opposition-based learning | |
| 650 | 4 | |a Multi-objective optimization | |
| 650 | 4 | |a Classification | |
| 700 | 1 | |a Teshnehlab, Mohammad |0 (orcid)0000-0003-2498-9653 |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Neural computing & applications |d Springer London, 1993 |g 33(2021), 24 vom: 02. Aug., Seite 17497-17533 |w (DE-627)165669608 |w (DE-600)1136944-9 |w (DE-576)032873050 |x 0941-0643 |7 nnns |
| 773 | 1 | 8 | |g volume:33 |g year:2021 |g number:24 |g day:02 |g month:08 |g pages:17497-17533 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00521-021-06340-9 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_4277 | ||
| 951 | |a AR | ||
| 952 | |d 33 |j 2021 |e 24 |b 02 |c 08 |h 17497-17533 | ||
| author_variant |
y s ys m t mt |
|---|---|
| matchkey_str |
article:09410643:2021----::poiinaebnrcmeiiepiiainloihuigieaynvhptas |
| hierarchy_sort_str |
2021 |
| publishDate |
2021 |
| allfields |
10.1007/s00521-021-06340-9 doi (DE-627)OLC2077367733 (DE-He213)s00521-021-06340-9-p DE-627 ger DE-627 rakwb eng 004 VZ Sharafi, Yousef verfasserin aut Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021 Abstract The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burden through the elimination of unnecessary features. This paper was conducted to propose an opposition-based binary competitive optimization algorithm, namely OBCOOA, to solve the wrapper-based feature selection problems. The basic idea of the competitive optimization algorithm (COOA) lies on the natural competition between different species to survive, which is a continuous algorithm inherently. The present study entailed the main contributions as follows: primarily, a time-varying V-shape transfer function was used in the optimization process to present the binary version of the COOA algorithm, which established the right balance between the exploration and exploitation phases; secondly, in the proposed algorithm, the opposition-based learning mechanism was utilized to improve the diversity quality within the population members and to incorporate a suitable initial population. In the feature selection problem, the classification error rate and the number of selected features objective functions are usually adopted, which causes this problem to convert into a multi-objective optimization one. This research presented a single- and multi-objective approach from the proposed algorithm in order to solve the feature selection problem. The proposed algorithm was applied to 27 benchmark datasets, and the evaluation results were compared to the other well-known binary optimization algorithms. The experimental results indicated that the proposed algorithm has a better ability to find an optimal subset of features with the least classification error rate and the number of the selected features. Feature selection Binary optimization Competitive optimization algorithm Opposition-based learning Multi-objective optimization Classification Teshnehlab, Mohammad (orcid)0000-0003-2498-9653 aut Enthalten in Neural computing & applications Springer London, 1993 33(2021), 24 vom: 02. Aug., Seite 17497-17533 (DE-627)165669608 (DE-600)1136944-9 (DE-576)032873050 0941-0643 nnns volume:33 year:2021 number:24 day:02 month:08 pages:17497-17533 https://doi.org/10.1007/s00521-021-06340-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_2018 GBV_ILN_4277 AR 33 2021 24 02 08 17497-17533 |
| spelling |
10.1007/s00521-021-06340-9 doi (DE-627)OLC2077367733 (DE-He213)s00521-021-06340-9-p DE-627 ger DE-627 rakwb eng 004 VZ Sharafi, Yousef verfasserin aut Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021 Abstract The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burden through the elimination of unnecessary features. This paper was conducted to propose an opposition-based binary competitive optimization algorithm, namely OBCOOA, to solve the wrapper-based feature selection problems. The basic idea of the competitive optimization algorithm (COOA) lies on the natural competition between different species to survive, which is a continuous algorithm inherently. The present study entailed the main contributions as follows: primarily, a time-varying V-shape transfer function was used in the optimization process to present the binary version of the COOA algorithm, which established the right balance between the exploration and exploitation phases; secondly, in the proposed algorithm, the opposition-based learning mechanism was utilized to improve the diversity quality within the population members and to incorporate a suitable initial population. In the feature selection problem, the classification error rate and the number of selected features objective functions are usually adopted, which causes this problem to convert into a multi-objective optimization one. This research presented a single- and multi-objective approach from the proposed algorithm in order to solve the feature selection problem. The proposed algorithm was applied to 27 benchmark datasets, and the evaluation results were compared to the other well-known binary optimization algorithms. The experimental results indicated that the proposed algorithm has a better ability to find an optimal subset of features with the least classification error rate and the number of the selected features. Feature selection Binary optimization Competitive optimization algorithm Opposition-based learning Multi-objective optimization Classification Teshnehlab, Mohammad (orcid)0000-0003-2498-9653 aut Enthalten in Neural computing & applications Springer London, 1993 33(2021), 24 vom: 02. Aug., Seite 17497-17533 (DE-627)165669608 (DE-600)1136944-9 (DE-576)032873050 0941-0643 nnns volume:33 year:2021 number:24 day:02 month:08 pages:17497-17533 https://doi.org/10.1007/s00521-021-06340-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_2018 GBV_ILN_4277 AR 33 2021 24 02 08 17497-17533 |
| allfields_unstemmed |
10.1007/s00521-021-06340-9 doi (DE-627)OLC2077367733 (DE-He213)s00521-021-06340-9-p DE-627 ger DE-627 rakwb eng 004 VZ Sharafi, Yousef verfasserin aut Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021 Abstract The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burden through the elimination of unnecessary features. This paper was conducted to propose an opposition-based binary competitive optimization algorithm, namely OBCOOA, to solve the wrapper-based feature selection problems. The basic idea of the competitive optimization algorithm (COOA) lies on the natural competition between different species to survive, which is a continuous algorithm inherently. The present study entailed the main contributions as follows: primarily, a time-varying V-shape transfer function was used in the optimization process to present the binary version of the COOA algorithm, which established the right balance between the exploration and exploitation phases; secondly, in the proposed algorithm, the opposition-based learning mechanism was utilized to improve the diversity quality within the population members and to incorporate a suitable initial population. In the feature selection problem, the classification error rate and the number of selected features objective functions are usually adopted, which causes this problem to convert into a multi-objective optimization one. This research presented a single- and multi-objective approach from the proposed algorithm in order to solve the feature selection problem. The proposed algorithm was applied to 27 benchmark datasets, and the evaluation results were compared to the other well-known binary optimization algorithms. The experimental results indicated that the proposed algorithm has a better ability to find an optimal subset of features with the least classification error rate and the number of the selected features. Feature selection Binary optimization Competitive optimization algorithm Opposition-based learning Multi-objective optimization Classification Teshnehlab, Mohammad (orcid)0000-0003-2498-9653 aut Enthalten in Neural computing & applications Springer London, 1993 33(2021), 24 vom: 02. Aug., Seite 17497-17533 (DE-627)165669608 (DE-600)1136944-9 (DE-576)032873050 0941-0643 nnns volume:33 year:2021 number:24 day:02 month:08 pages:17497-17533 https://doi.org/10.1007/s00521-021-06340-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_2018 GBV_ILN_4277 AR 33 2021 24 02 08 17497-17533 |
| allfieldsGer |
10.1007/s00521-021-06340-9 doi (DE-627)OLC2077367733 (DE-He213)s00521-021-06340-9-p DE-627 ger DE-627 rakwb eng 004 VZ Sharafi, Yousef verfasserin aut Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021 Abstract The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burden through the elimination of unnecessary features. This paper was conducted to propose an opposition-based binary competitive optimization algorithm, namely OBCOOA, to solve the wrapper-based feature selection problems. The basic idea of the competitive optimization algorithm (COOA) lies on the natural competition between different species to survive, which is a continuous algorithm inherently. The present study entailed the main contributions as follows: primarily, a time-varying V-shape transfer function was used in the optimization process to present the binary version of the COOA algorithm, which established the right balance between the exploration and exploitation phases; secondly, in the proposed algorithm, the opposition-based learning mechanism was utilized to improve the diversity quality within the population members and to incorporate a suitable initial population. In the feature selection problem, the classification error rate and the number of selected features objective functions are usually adopted, which causes this problem to convert into a multi-objective optimization one. This research presented a single- and multi-objective approach from the proposed algorithm in order to solve the feature selection problem. The proposed algorithm was applied to 27 benchmark datasets, and the evaluation results were compared to the other well-known binary optimization algorithms. The experimental results indicated that the proposed algorithm has a better ability to find an optimal subset of features with the least classification error rate and the number of the selected features. Feature selection Binary optimization Competitive optimization algorithm Opposition-based learning Multi-objective optimization Classification Teshnehlab, Mohammad (orcid)0000-0003-2498-9653 aut Enthalten in Neural computing & applications Springer London, 1993 33(2021), 24 vom: 02. Aug., Seite 17497-17533 (DE-627)165669608 (DE-600)1136944-9 (DE-576)032873050 0941-0643 nnns volume:33 year:2021 number:24 day:02 month:08 pages:17497-17533 https://doi.org/10.1007/s00521-021-06340-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_2018 GBV_ILN_4277 AR 33 2021 24 02 08 17497-17533 |
| allfieldsSound |
10.1007/s00521-021-06340-9 doi (DE-627)OLC2077367733 (DE-He213)s00521-021-06340-9-p DE-627 ger DE-627 rakwb eng 004 VZ Sharafi, Yousef verfasserin aut Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021 Abstract The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burden through the elimination of unnecessary features. This paper was conducted to propose an opposition-based binary competitive optimization algorithm, namely OBCOOA, to solve the wrapper-based feature selection problems. The basic idea of the competitive optimization algorithm (COOA) lies on the natural competition between different species to survive, which is a continuous algorithm inherently. The present study entailed the main contributions as follows: primarily, a time-varying V-shape transfer function was used in the optimization process to present the binary version of the COOA algorithm, which established the right balance between the exploration and exploitation phases; secondly, in the proposed algorithm, the opposition-based learning mechanism was utilized to improve the diversity quality within the population members and to incorporate a suitable initial population. In the feature selection problem, the classification error rate and the number of selected features objective functions are usually adopted, which causes this problem to convert into a multi-objective optimization one. This research presented a single- and multi-objective approach from the proposed algorithm in order to solve the feature selection problem. The proposed algorithm was applied to 27 benchmark datasets, and the evaluation results were compared to the other well-known binary optimization algorithms. The experimental results indicated that the proposed algorithm has a better ability to find an optimal subset of features with the least classification error rate and the number of the selected features. Feature selection Binary optimization Competitive optimization algorithm Opposition-based learning Multi-objective optimization Classification Teshnehlab, Mohammad (orcid)0000-0003-2498-9653 aut Enthalten in Neural computing & applications Springer London, 1993 33(2021), 24 vom: 02. Aug., Seite 17497-17533 (DE-627)165669608 (DE-600)1136944-9 (DE-576)032873050 0941-0643 nnns volume:33 year:2021 number:24 day:02 month:08 pages:17497-17533 https://doi.org/10.1007/s00521-021-06340-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_2018 GBV_ILN_4277 AR 33 2021 24 02 08 17497-17533 |
| language |
English |
| source |
Enthalten in Neural computing & applications 33(2021), 24 vom: 02. Aug., Seite 17497-17533 volume:33 year:2021 number:24 day:02 month:08 pages:17497-17533 |
| sourceStr |
Enthalten in Neural computing & applications 33(2021), 24 vom: 02. Aug., Seite 17497-17533 volume:33 year:2021 number:24 day:02 month:08 pages:17497-17533 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Feature selection Binary optimization Competitive optimization algorithm Opposition-based learning Multi-objective optimization Classification |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Neural computing & applications |
| authorswithroles_txt_mv |
Sharafi, Yousef @@aut@@ Teshnehlab, Mohammad @@aut@@ |
| publishDateDaySort_date |
2021-08-02T00:00:00Z |
| hierarchy_top_id |
165669608 |
| dewey-sort |
14 |
| id |
OLC2077367733 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2077367733</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505144427.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00521-021-06340-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2077367733</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00521-021-06340-9-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sharafi, Yousef</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burden through the elimination of unnecessary features. This paper was conducted to propose an opposition-based binary competitive optimization algorithm, namely OBCOOA, to solve the wrapper-based feature selection problems. The basic idea of the competitive optimization algorithm (COOA) lies on the natural competition between different species to survive, which is a continuous algorithm inherently. The present study entailed the main contributions as follows: primarily, a time-varying V-shape transfer function was used in the optimization process to present the binary version of the COOA algorithm, which established the right balance between the exploration and exploitation phases; secondly, in the proposed algorithm, the opposition-based learning mechanism was utilized to improve the diversity quality within the population members and to incorporate a suitable initial population. In the feature selection problem, the classification error rate and the number of selected features objective functions are usually adopted, which causes this problem to convert into a multi-objective optimization one. This research presented a single- and multi-objective approach from the proposed algorithm in order to solve the feature selection problem. The proposed algorithm was applied to 27 benchmark datasets, and the evaluation results were compared to the other well-known binary optimization algorithms. The experimental results indicated that the proposed algorithm has a better ability to find an optimal subset of features with the least classification error rate and the number of the selected features.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Feature selection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Binary optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Competitive optimization algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Opposition-based learning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-objective optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Classification</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Teshnehlab, Mohammad</subfield><subfield code="0">(orcid)0000-0003-2498-9653</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Neural computing & applications</subfield><subfield code="d">Springer London, 1993</subfield><subfield code="g">33(2021), 24 vom: 02. Aug., Seite 17497-17533</subfield><subfield code="w">(DE-627)165669608</subfield><subfield code="w">(DE-600)1136944-9</subfield><subfield code="w">(DE-576)032873050</subfield><subfield code="x">0941-0643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:33</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:24</subfield><subfield code="g">day:02</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:17497-17533</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00521-021-06340-9</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">33</subfield><subfield code="j">2021</subfield><subfield code="e">24</subfield><subfield code="b">02</subfield><subfield code="c">08</subfield><subfield code="h">17497-17533</subfield></datafield></record></collection>
|
| author |
Sharafi, Yousef |
| spellingShingle |
Sharafi, Yousef ddc 004 misc Feature selection misc Binary optimization misc Competitive optimization algorithm misc Opposition-based learning misc Multi-objective optimization misc Classification Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection |
| authorStr |
Sharafi, Yousef |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)165669608 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0941-0643 |
| topic_title |
004 VZ Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection Feature selection Binary optimization Competitive optimization algorithm Opposition-based learning Multi-objective optimization Classification |
| topic |
ddc 004 misc Feature selection misc Binary optimization misc Competitive optimization algorithm misc Opposition-based learning misc Multi-objective optimization misc Classification |
| topic_unstemmed |
ddc 004 misc Feature selection misc Binary optimization misc Competitive optimization algorithm misc Opposition-based learning misc Multi-objective optimization misc Classification |
| topic_browse |
ddc 004 misc Feature selection misc Binary optimization misc Competitive optimization algorithm misc Opposition-based learning misc Multi-objective optimization misc Classification |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Neural computing & applications |
| hierarchy_parent_id |
165669608 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Neural computing & applications |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)165669608 (DE-600)1136944-9 (DE-576)032873050 |
| title |
Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection |
| ctrlnum |
(DE-627)OLC2077367733 (DE-He213)s00521-021-06340-9-p |
| title_full |
Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection |
| author_sort |
Sharafi, Yousef |
| journal |
Neural computing & applications |
| journalStr |
Neural computing & applications |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2021 |
| contenttype_str_mv |
txt |
| container_start_page |
17497 |
| author_browse |
Sharafi, Yousef Teshnehlab, Mohammad |
| container_volume |
33 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Sharafi, Yousef |
| doi_str_mv |
10.1007/s00521-021-06340-9 |
| normlink |
(ORCID)0000-0003-2498-9653 |
| normlink_prefix_str_mv |
(orcid)0000-0003-2498-9653 |
| dewey-full |
004 |
| title_sort |
opposition-based binary competitive optimization algorithm using time-varying v-shape transfer function for feature selection |
| title_auth |
Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection |
| abstract |
Abstract The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burden through the elimination of unnecessary features. This paper was conducted to propose an opposition-based binary competitive optimization algorithm, namely OBCOOA, to solve the wrapper-based feature selection problems. The basic idea of the competitive optimization algorithm (COOA) lies on the natural competition between different species to survive, which is a continuous algorithm inherently. The present study entailed the main contributions as follows: primarily, a time-varying V-shape transfer function was used in the optimization process to present the binary version of the COOA algorithm, which established the right balance between the exploration and exploitation phases; secondly, in the proposed algorithm, the opposition-based learning mechanism was utilized to improve the diversity quality within the population members and to incorporate a suitable initial population. In the feature selection problem, the classification error rate and the number of selected features objective functions are usually adopted, which causes this problem to convert into a multi-objective optimization one. This research presented a single- and multi-objective approach from the proposed algorithm in order to solve the feature selection problem. The proposed algorithm was applied to 27 benchmark datasets, and the evaluation results were compared to the other well-known binary optimization algorithms. The experimental results indicated that the proposed algorithm has a better ability to find an optimal subset of features with the least classification error rate and the number of the selected features. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021 |
| abstractGer |
Abstract The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burden through the elimination of unnecessary features. This paper was conducted to propose an opposition-based binary competitive optimization algorithm, namely OBCOOA, to solve the wrapper-based feature selection problems. The basic idea of the competitive optimization algorithm (COOA) lies on the natural competition between different species to survive, which is a continuous algorithm inherently. The present study entailed the main contributions as follows: primarily, a time-varying V-shape transfer function was used in the optimization process to present the binary version of the COOA algorithm, which established the right balance between the exploration and exploitation phases; secondly, in the proposed algorithm, the opposition-based learning mechanism was utilized to improve the diversity quality within the population members and to incorporate a suitable initial population. In the feature selection problem, the classification error rate and the number of selected features objective functions are usually adopted, which causes this problem to convert into a multi-objective optimization one. This research presented a single- and multi-objective approach from the proposed algorithm in order to solve the feature selection problem. The proposed algorithm was applied to 27 benchmark datasets, and the evaluation results were compared to the other well-known binary optimization algorithms. The experimental results indicated that the proposed algorithm has a better ability to find an optimal subset of features with the least classification error rate and the number of the selected features. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021 |
| abstract_unstemmed |
Abstract The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burden through the elimination of unnecessary features. This paper was conducted to propose an opposition-based binary competitive optimization algorithm, namely OBCOOA, to solve the wrapper-based feature selection problems. The basic idea of the competitive optimization algorithm (COOA) lies on the natural competition between different species to survive, which is a continuous algorithm inherently. The present study entailed the main contributions as follows: primarily, a time-varying V-shape transfer function was used in the optimization process to present the binary version of the COOA algorithm, which established the right balance between the exploration and exploitation phases; secondly, in the proposed algorithm, the opposition-based learning mechanism was utilized to improve the diversity quality within the population members and to incorporate a suitable initial population. In the feature selection problem, the classification error rate and the number of selected features objective functions are usually adopted, which causes this problem to convert into a multi-objective optimization one. This research presented a single- and multi-objective approach from the proposed algorithm in order to solve the feature selection problem. The proposed algorithm was applied to 27 benchmark datasets, and the evaluation results were compared to the other well-known binary optimization algorithms. The experimental results indicated that the proposed algorithm has a better ability to find an optimal subset of features with the least classification error rate and the number of the selected features. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_2018 GBV_ILN_4277 |
| container_issue |
24 |
| title_short |
Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection |
| url |
https://doi.org/10.1007/s00521-021-06340-9 |
| remote_bool |
false |
| author2 |
Teshnehlab, Mohammad |
| author2Str |
Teshnehlab, Mohammad |
| ppnlink |
165669608 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00521-021-06340-9 |
| up_date |
2024-07-03T15:10:58.309Z |
| _version_ |
1803571123515817984 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2077367733</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505144427.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00521-021-06340-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2077367733</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00521-021-06340-9-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sharafi, Yousef</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burden through the elimination of unnecessary features. This paper was conducted to propose an opposition-based binary competitive optimization algorithm, namely OBCOOA, to solve the wrapper-based feature selection problems. The basic idea of the competitive optimization algorithm (COOA) lies on the natural competition between different species to survive, which is a continuous algorithm inherently. The present study entailed the main contributions as follows: primarily, a time-varying V-shape transfer function was used in the optimization process to present the binary version of the COOA algorithm, which established the right balance between the exploration and exploitation phases; secondly, in the proposed algorithm, the opposition-based learning mechanism was utilized to improve the diversity quality within the population members and to incorporate a suitable initial population. In the feature selection problem, the classification error rate and the number of selected features objective functions are usually adopted, which causes this problem to convert into a multi-objective optimization one. This research presented a single- and multi-objective approach from the proposed algorithm in order to solve the feature selection problem. The proposed algorithm was applied to 27 benchmark datasets, and the evaluation results were compared to the other well-known binary optimization algorithms. The experimental results indicated that the proposed algorithm has a better ability to find an optimal subset of features with the least classification error rate and the number of the selected features.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Feature selection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Binary optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Competitive optimization algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Opposition-based learning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-objective optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Classification</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Teshnehlab, Mohammad</subfield><subfield code="0">(orcid)0000-0003-2498-9653</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Neural computing & applications</subfield><subfield code="d">Springer London, 1993</subfield><subfield code="g">33(2021), 24 vom: 02. Aug., Seite 17497-17533</subfield><subfield code="w">(DE-627)165669608</subfield><subfield code="w">(DE-600)1136944-9</subfield><subfield code="w">(DE-576)032873050</subfield><subfield code="x">0941-0643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:33</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:24</subfield><subfield code="g">day:02</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:17497-17533</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00521-021-06340-9</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">33</subfield><subfield code="j">2021</subfield><subfield code="e">24</subfield><subfield code="b">02</subfield><subfield code="c">08</subfield><subfield code="h">17497-17533</subfield></datafield></record></collection>
|
| score |
7.399392 |