{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T07:12:13Z","timestamp":1724915533510},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2013QNA51"],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Jiangsu province","award":["BK2011215"]},{"name":"China Postdoctoral Science Foundation funded project","award":["2012M521142"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1016\/j.neucom.2012.09.049","type":"journal-article","created":{"date-parts":[[2014,7,30]],"date-time":"2014-07-30T01:02:44Z","timestamp":1406682164000},"page":"150-157","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":206,"special_numbering":"C","title":["Feature selection algorithm based on bare bones particle swarm optimization"],"prefix":"10.1016","volume":"148","author":[{"given":"Yong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Dunwei","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Wanqiu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.neucom.2012.09.049_bib1","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1016\/j.ins.2010.11.008","article-title":"Applying electromagnetism-like mechanism for feature selection","volume":"181","author":"Su","year":"2011","journal-title":"Inf. Sci."},{"key":"10.1016\/j.neucom.2012.09.049_bib2","doi-asserted-by":"crossref","unstructured":"A.E. Mohamed, G. Gilles, S. Yahya, Adaptive particle swarm optimizer for feature selection, in: Proceedings of the Eleventh International Conference on Intelligent Data Engineering and Automated Learning. Lecture Notes in Computer Science 6283, 2010, pp. 226\u2013233.","DOI":"10.1007\/978-3-642-15381-5_28"},{"issue":"7","key":"10.1016\/j.neucom.2012.09.049_bib3","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1109\/TPAMI.2004.28","article-title":"Fast branch and bound algorithms for optimal feature selection","volume":"26","author":"Somol","year":"2004","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"10.1016\/j.neucom.2012.09.049_bib4","doi-asserted-by":"crossref","first-page":"3088","DOI":"10.1016\/j.cor.2005.01.021","article-title":"Optimization-based feature selection with adaptive instance sampling","volume":"33","author":"Yang","year":"2006","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.neucom.2012.09.049_bib5","first-page":"1424","article-title":"Hybrid genetic algorithms for feature selection","volume":"26","author":"Oh","year":"2004","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1\u20133","key":"10.1016\/j.neucom.2012.09.049_bib6","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.neucom.2009.07.014","article-title":"ACO-based hybrid classification system with feature subset selection and model parameters optimization","volume":"73","author":"Huang","year":"2009","journal-title":"Neurocomputing"},{"issue":"4","key":"10.1016\/j.neucom.2012.09.049_bib7","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1016\/j.asoc.2007.10.012","article-title":"Parameter determination of support vector machine and feature selection using simulated annealing approach","volume":"8","author":"Lin","year":"2008","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.neucom.2012.09.049_bib8","doi-asserted-by":"crossref","unstructured":"J. Kennedy, R.C. Eberhart, Particle swarm optimization, in: Proceedings of IEEE International Conference on Neural Networks, 1995, pp. 1942\u20131948.","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4","key":"10.1016\/j.neucom.2012.09.049_bib9","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.patrec.2006.09.003","article-title":"Feature selection based onrough sets and particle swarm optimization","volume":"28","author":"Wang","year":"2007","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.neucom.2012.09.049_bib10","doi-asserted-by":"crossref","unstructured":"E.G. Talbi, L. Jourdan, J. Garcia-Nieto, E. Alba, Comparison of population based metaheuristics for feature selection: application to microarray data classification, in: Proceedings of AICCSA, 2008.","DOI":"10.1109\/AICCSA.2008.4493515"},{"issue":"1","key":"10.1016\/j.neucom.2012.09.049_bib11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.asoc.2009.11.014","article-title":"Chaotic maps based on binary particle swarm optimization for feature selection","volume":"11","author":"Chuang","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.neucom.2012.09.049_bib12","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.ejor.2010.02.032","article-title":"A discrete particle swarm optimization method for feature selection in binary classification problems","volume":"206","author":"Alper","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.neucom.2012.09.049_bib13","doi-asserted-by":"crossref","first-page":"13367","DOI":"10.1016\/j.eswa.2011.04.165","article-title":"Gene selection and classification using Taguchi chaotic binary particle swarm optimization","volume":"38","author":"Chuang","year":"2011","journal-title":"Expert Syst. Appl."},{"issue":"22","key":"10.1016\/j.neucom.2012.09.049_bib14","doi-asserted-by":"crossref","first-page":"5033","DOI":"10.1016\/j.ins.2007.06.018","article-title":"Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients","volume":"177","author":"Tripathi","year":"2007","journal-title":"Inf. Sci."},{"key":"10.1016\/j.neucom.2012.09.049_bib15","doi-asserted-by":"crossref","unstructured":"J. Kennedy, Bare bones particle swarms, in: Proceeding of the 2003 IEEE Swarm Intelligence Symposium, 2003, pp. 80\u201387.","DOI":"10.1109\/SIS.2003.1202251"},{"key":"10.1016\/j.neucom.2012.09.049_bib16","doi-asserted-by":"crossref","unstructured":"M.G.H. Omran, A. Engelbrecht, A. Salman, Barebones particle swarm for integer programming problems, in: Proceeding of the 2007 IEEE Swarm Intelligence Symposium, 2007, pp. 170\u2013175.","DOI":"10.1109\/SIS.2007.368042"},{"key":"10.1016\/j.neucom.2012.09.049_bib17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.fluid.2010.10.025","article-title":"Novel bare bones particle swarm optimization and its performance for modeling vapor-liquid equilibrium data","volume":"301","author":"Zhang","year":"2010","journal-title":"Fluid Phase Equilib."},{"issue":"1","key":"10.1016\/j.neucom.2012.09.049_bib18","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.ins.2011.06.004","article-title":"Barebones multi-objective particle swarm optimization for environmental\/economic dispatch","volume":"192","author":"Zhang","year":"2012","journal-title":"Inf. Sci."},{"key":"10.1016\/j.neucom.2012.09.049_bib19","unstructured":"Y.H. Shi, R. C. Eberhart, A modied particle swarm optimizer, in: Proceeding of IEEE Congress on Evolutionary Computation, 1998, pp. 303\u2013308."},{"key":"10.1016\/j.neucom.2012.09.049_bib20","doi-asserted-by":"crossref","unstructured":"J. Kennedy, R.C. Eberhart, A discrete binary version of the particle swarm algorithm, in: Proceedings of 1997 Conference Systems Man and Cybernetics, 1997, pp. 4104\u20134108.","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"10.1016\/j.neucom.2012.09.049_bib21","doi-asserted-by":"crossref","unstructured":"F. Pan, X. Hu, R. Eberhart, Y. Chen, An analysis of bare bones particle swarm, in: Proceeding of the 2008 IEEE Swarm Intelligence Symposium, September 2008, pp. 21\u201323.","DOI":"10.1109\/SIS.2008.4668301"},{"key":"10.1016\/j.neucom.2012.09.049_bib22","unstructured":"E. Fix, J.L. Hodges, Discriminatory Analysis-nonparametric Discrimination: Consistency Properties. Project 21-49-004, Report 4, US Air Force School of Aviation Medicine, Randolph Field, 1951, pp. 261\u2013279."},{"key":"10.1016\/j.neucom.2012.09.049_bib23","unstructured":"P.M. Murphy, D.W. Aha, UCI Repository of Machine Learning Databases. Technical report, Department of Information and Computer Science, University of California, Irvine, California. Available at: \u3008http:\/\/www.ics.uci.edu\/~mlearn\/~MLRepository.html\u3009."},{"key":"10.1016\/j.neucom.2012.09.049_bib24","doi-asserted-by":"crossref","first-page":"12699","DOI":"10.1016\/j.eswa.2011.04.057","article-title":"Improved binary particle swarm optimization using catfish effect for feature selection","volume":"38","author":"Chuang","year":"2011","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.neucom.2012.09.049_bib25","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4235.985692","article-title":"The particle swarm-explosion, stability, and convergence in a multidimensional complex space","volume":"6","author":"Clerc","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"8","key":"10.1016\/j.neucom.2012.09.049_bib26","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/j.ins.2005.02.003","article-title":"A study of particle swarm optimization particle trajectories","volume":"176","author":"Van den Bergh","year":"2006","journal-title":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.neucom.2012.09.049_bib27","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10589-009-9284-z","article-title":"MO-TRIBES, an adaptive multiobjective particle swarm optimization algorithm","volume":"49","author":"Cooren","year":"2011","journal-title":"Comput. Optim. Appl."},{"issue":"9","key":"10.1016\/j.neucom.2012.09.049_bib28","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","article-title":"A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem","volume":"35","author":"Pan","year":"2008","journal-title":"Comput. Oper. Res."},{"issue":"7\u20138","key":"10.1016\/j.neucom.2012.09.049_bib29","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1007\/s00170-007-1252-0","article-title":"No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm","volume":"39","author":"Pan","year":"2008","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"2","key":"10.1016\/j.neucom.2012.09.049_bib30","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TSMCC.2011.2148712","article-title":"Optimizing the vehicle routing problem with time windows","volume":"42","author":"Gong","year":"2012","journal-title":"IEEE Trans. Syst., Man Cybern. C: Appl. Rev."},{"issue":"1","key":"10.1016\/j.neucom.2012.09.049_bib31","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1214\/aoms\/1177730491","article-title":"On a test of whether one of two random variables is stochastically larger than the other","volume":"18","author":"Mann","year":"1947","journal-title":"Ann. Math. Stat."}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231214009229?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231214009229?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T23:26:32Z","timestamp":1589239592000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231214009229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":31,"alternative-id":["S0925231214009229"],"URL":"https:\/\/doi.org\/10.1016\/j.neucom.2012.09.049","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2015,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Feature selection algorithm based on bare bones particle swarm optimization","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neucom.2012.09.049","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1016%2FJ.NEUCOM.2012.09.049', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>2</sup></a></div><div><a href='#diffid878' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:878', '*');; return false;" style='text-decoration: none; '>Note </a> <a style='color: white;' href='#diffid878'><sup>1</sup></a></div><div><a href='#diffid115' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:115', '*');; return false;" style='text-decoration: none; '>Project </a> <a style='color: white;' href='#diffid115'><sup>2</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>