{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:46:33Z","timestamp":1777704393036,"version":"3.51.4"},"reference-count":44,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T00:00:00Z","timestamp":1595980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2020,11,19]]},"abstract":"<jats:p>\n                    Feature selection (FS) has become an essential task in overcoming high dimensional and complex machine learning problems. FS is a process used for reducing the size of the dataset by separating or extracting unnecessary and unrelated properties from it. This process improves the performance of classification algorithms and reduces the evaluation time by enabling the use of small sized datasets with useful features during the classification process. FS aims to gain a minimal feature subset in a problem domain while retaining the accuracy of the original data. In this study, four computational intelligence techniques, namely, migrating birds optimization (MBO), simulated annealing (SA), differential evolution (DE) and particle swarm optimization (PSO) are implemented for the FS problem as search algorithms and compared on the 17 well-known datasets taken from UCI machine learning repository where the dimension of the tackled datasets vary from 4 to 500. This is the first time that MBO is applied for solving the FS problem. In order to judge the quality of the subsets generated by the search algorithms, two different subset evaluation methods are implemented in this study. These methods are probabilistic consistency-based FS (PCFS) and correlation-based FS (CFS). Performance comparison of the algorithms is done by using three well-known classifiers;\n                    <jats:italic>k<\/jats:italic>\n                    -nearest neighbor, naive bayes and decision tree (C4.5). As a benchmark, the accuracy values found by classifiers using the datasets with all features are used. Results of the experiments show that our MBO-based filter approach outperforms the other three approaches in terms of accuracy values. In the experiments, it is also observed that as a subset evaluator CFS outperforms PCFS and as a classifier C4.5 gets better results when compared to\n                    <jats:italic>k<\/jats:italic>\n                    -nearest neighbor and naive bayes.\n                  <\/jats:p>","DOI":"10.3233\/jifs-189090","type":"journal-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T12:54:24Z","timestamp":1596200064000},"page":"6205-6216","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["Feature selection via computational intelligence techniques"],"prefix":"10.1177","volume":"39","author":[{"given":"Ramazan","family":"Algin","sequence":"first","affiliation":[{"name":"Computer Engineering Department, Marmara University, Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali Fuat","family":"Alkaya","sequence":"additional","affiliation":[{"name":"Computer Engineering Department, Marmara University, Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustafa","family":"Agaoglu","sequence":"additional","affiliation":[{"name":"Computer Engineering Department, Marmara University, Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2020,7,29]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2012.09.003"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2012.2227469"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2504420"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/3477.990877"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00153759"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.06.032"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.10.028"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.06.004"},{"key":"e_1_3_1_10_2","unstructured":"JohnG.H. and LangleyP. Estimating continuous distributions in Bayesian classifiers. In Proceedings of the Eleventh conference on Uncertainty in Artificial intelligence (1995) (pp. 338\u2013345). Morgan Kaufmann Publishers Inc."},{"key":"e_1_3_1_11_2","doi-asserted-by":"crossref","unstructured":"KalayciG.T. AlkayaA.F. and AlginR. Exploitation and Comparison of Computational Intelligence Techniques on the Feature Selection Problem. In International Conference on Intelligent and Fuzzy Systems (2019) (pp. 1243\u20131249) Springer Cham.","DOI":"10.1007\/978-3-030-23756-1_146"},{"key":"e_1_3_1_12_2","doi-asserted-by":"crossref","unstructured":"GaoH.H. YangH.H. and WangX.Y. Ant colony optimization based network intrusion feature selection and detection. In 2005 international conference on machine learning and cybernetics (2005) (Vol. 6 pp. 3871\u20133875). IEEE.","DOI":"10.1109\/ICMLC.2005.1527615"},{"key":"e_1_3_1_13_2","doi-asserted-by":"crossref","unstructured":"MingH. A rough set based hybrid method to feature selection. In 2008 International Symposium on Knowledge Acquisition and Modeling (2008) pp. 585\u2013588 IEEE.","DOI":"10.1109\/KAM.2008.12"},{"key":"e_1_3_1_14_2","first-page":"1157","article-title":"An introduction to variable and feature selection","volume":"3","author":"Guyon I.","year":"2003","unstructured":"GuyonI. and ElisseeffA., An introduction to variable and feature selection, Journal of Machine Learning Research 3(Mar), (2003), 1157\u20131182.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.105"},{"key":"e_1_3_1_16_2","doi-asserted-by":"crossref","unstructured":"Garcia-NietoJ. AlbaE. and ApolloniJ. Hybrid DE-SVM approach for feature selection: application to gene expression datasets. In 2009 2nd International Symposium on Logistics and Industrial Informatics (2009) pp. 1\u20136 IEEE.","DOI":"10.1109\/LINDI.2009.5258761"},{"key":"e_1_3_1_17_2","doi-asserted-by":"crossref","unstructured":"KennedyJ. and EberhartR. Particle swarm optimization (PSO). In Proc. IEEE International Conference on Neural Networks Perth Australia (1995) (pp. 1942\u20131948).","DOI":"10.1109\/ICNN.1995.488968"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3136625"},{"key":"e_1_3_1_19_2","article-title":"Feature selection for classification: A review,","volume":"37","author":"Tang J.","year":"2014","unstructured":"TangJ., AlelyaniS. and LiuH., Feature selection for classification: A review, , Data classification: Algorithms and applications 37 (2014).","journal-title":"Data classification: Algorithms and applications"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.11.014"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.04.057"},{"key":"e_1_3_1_22_2","unstructured":"HallM.A. Correlation-based feature selection for machine learning (1999)."},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-1997-1302"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(03)00079-1"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(99)00041-2"},{"key":"e_1_3_1_26_2","unstructured":"LichmanM. UCI machine learning repository (2013)."},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-015-9428-8"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2006.889761"},{"key":"e_1_3_1_29_2","doi-asserted-by":"crossref","unstructured":"JensenR. and ShenQ. Computational intelligence and feature selection: rough and fuzzy approaches (Vol. 8) (2008) John Wiley and Sons.","DOI":"10.1002\/9780470377888"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00043-X"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.09.010"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.03.028"},{"key":"e_1_3_1_33_2","unstructured":"QuinlanR. C4.5: Programs for Machine Learning Morgan Kaufmann Publishers (1993) San Mateo CA."},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-007-0002-0"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2010.03.016"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-013-1150-3"},{"key":"e_1_3_1_39_2","doi-asserted-by":"crossref","unstructured":"HamdaniT.M. WonJ.M. AlimiA.M. and KarrayF. Multi-objective feature selection with NSGA II. In International conference on adaptive and natural computing algorithms (2007) pp. 240\u2013247 Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-540-71618-1_27"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1397-3"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2006.09.003"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1672-6529(11)60020-6"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2015.2476796"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/1007730.1007741"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.883267"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-189090","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-189090","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-189090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:41:07Z","timestamp":1777455667000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-189090"}},"subtitle":[],"editor":[{"given":"Cengiz","family":"Kahraman","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,7,29]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,11,19]]}},"alternative-id":["10.3233\/JIFS-189090"],"URL":"https:\/\/doi.org\/10.3233\/jifs-189090","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,29]]}}}