{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T15:26:47Z","timestamp":1655306807385},"reference-count":25,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Info. Tech. Dec. Mak."],"published-print":{"date-parts":[[2017,9]]},"abstract":"<jats:p> Feature selection is an important research field for pattern classification, data mining, etc. Population-based optimization algorithms (POA) have high parallelism and are widely used as search algorithm for feature selection. Population-based feature selection algorithms (PFSA) involve compromise between precision and time cost. In order to optimize the PFSA, the feature selection models need to be improved. Feature selection algorithms broadly fall into two categories: the filter model and the wrapper model. The filter model is fast but less precise; while the wrapper model is more precise but generally computationally more intensive. In this paper, we proposed a new mechanism \u2014 proportional hybrid mechanism (PHM) to combine the advantages of filter and wrapper models. The mechanism can be applied in PFSA to improve their performance. Genetic algorithm (GA) has been applied in many kinds of feature selection problems as search algorithm because of its high efficiency and implicit parallelism. Therefore, GAs are used in this paper. In order to validate the mechanism, seven datasets from university of California Irvine (UCI) database and artificial toy datasets are tested. The experiments are carried out for different GAs, classifiers, and evaluation criteria, the results show that with the introduction of PHM, the GA-based feature selection algorithm can be improved in both time cost and classification accuracy. Moreover, the comparison of GA-based, PSO-based and some other feature selection algorithms demonstrate that the PHM can be used in other population-based feature selection algorithms and obtain satisfying results. <\/jats:p>","DOI":"10.1142\/s0219622014500096","type":"journal-article","created":{"date-parts":[[2014,2,6]],"date-time":"2014-02-06T03:48:46Z","timestamp":1391658526000},"page":"1309-1338","source":"Crossref","is-referenced-by-count":5,"title":["Proportional Hybrid Mechanism for Population Based Feature Selection Algorithm"],"prefix":"10.1142","volume":"16","author":[{"given":"Pin","family":"Wang","sequence":"first","affiliation":[{"name":"College of Communication Engineering, Chongqing University, Chongqing 400030, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongming","family":"Li","sequence":"additional","affiliation":[{"name":"College of Communication Engineering, Chongqing University, Chongqing 400030, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bohan","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Communication Engineering, Chongqing University, Chongqing 400030, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianling","family":"Hu","sequence":"additional","affiliation":[{"name":"College of Communication Engineering, Chongqing University, Chongqing 400030, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Yan","sequence":"additional","affiliation":[{"name":"College of Communication Engineering, Chongqing University, Chongqing 400030, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Xia","sequence":"additional","affiliation":[{"name":"College of Communication Engineering, Chongqing University, Chongqing 400030, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Yang","sequence":"additional","affiliation":[{"name":"Chongqing Communication College, Chongqing 400035, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2017,9,19]]},"reference":[{"key":"S0219622014500096BIB001","first-page":"1157","volume":"3","author":"Guyon I.","year":"2003","journal-title":"Journal of Machine Learning Research"},{"key":"S0219622014500096BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2008.02.025"},{"key":"S0219622014500096BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/S1672-6529(11)60020-6"},{"key":"S0219622014500096BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.08.050"},{"key":"S0219622014500096BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2007.05.011"},{"key":"S0219622014500096BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.66"},{"key":"S0219622014500096BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00043-X"},{"key":"S0219622014500096BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00063-5"},{"key":"S0219622014500096BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/S1088-467X(97)00008-5"},{"key":"S0219622014500096BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.artmed.2004.01.007"},{"issue":"2","key":"S0219622014500096BIB011","first-page":"207","volume":"32","author":"Hsu C. N.","year":"2004","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics"},{"key":"S0219622014500096BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.11.001"},{"key":"S0219622014500096BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2008.05.005"},{"key":"S0219622014500096BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.883267"},{"key":"S0219622014500096BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.05.037"},{"key":"S0219622014500096BIB018","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.105"},{"key":"S0219622014500096BIB020","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2005.859374"},{"key":"S0219622014500096BIB021","unstructured":"Haykin S. ,  Neural Networks: A Comprehensive Foundation,  2nd  edn.   (Tsinghua University Press & Prentice Hall,  1999), pp.  199\u2013202."},{"key":"S0219622014500096BIB022","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04131-4"},{"key":"S0219622014500096BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/21.286385"},{"key":"S0219622014500096BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2008.02.010"},{"key":"S0219622014500096BIB026","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.10.006"},{"key":"S0219622014500096BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.09.010"},{"key":"S0219622014500096BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.08.088"},{"key":"S0219622014500096BIB029","first-page":"1","volume":"7","author":"Dem\u0161ar J.","year":"2006","journal-title":"Journal of Machine Learning Research"}],"container-title":["International Journal of Information Technology &amp; Decision Making"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219622014500096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:14:25Z","timestamp":1565122465000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219622014500096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":25,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2017,9,19]]},"published-print":{"date-parts":[[2017,9]]}},"alternative-id":["10.1142\/S0219622014500096"],"URL":"https:\/\/doi.org\/10.1142\/s0219622014500096","relation":{},"ISSN":["0219-6220","1793-6845"],"issn-type":[{"value":"0219-6220","type":"print"},{"value":"1793-6845","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9]]}}}