{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T04:54:03Z","timestamp":1744174443975,"version":"3.37.3"},"reference-count":82,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100012659","name":"The National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61373015","61728204"],"id":[{"id":"10.13039\/501100012659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201806830058"],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"name":"State Key Laboratory for smart grid protection and operation control Foundation, China"},{"name":"Science and Technology Funds, China"},{"name":"NUPTSF, China","award":["NY219142"]},{"DOI":"10.13039\/501100000038","name":"NSERC of Canada","doi-asserted-by":"publisher","award":["6466-15"],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1016\/j.knosys.2019.104938","type":"journal-article","created":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T11:36:30Z","timestamp":1565696190000},"page":"104938","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"special_numbering":"C","title":["A novel test-cost-sensitive attribute reduction approach using the binary bat algorithm"],"prefix":"10.1016","volume":"186","author":[{"given":"Xiaojun","family":"Xie","sequence":"first","affiliation":[]},{"given":"Xiaolin","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Qian","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Yanghao","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Tong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ryszard","family":"Janicki","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.knosys.2019.104938_b1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","article-title":"Rough set","volume":"11","author":"Pawlak","year":"1982","journal-title":"Int. J. Comput. Inf. Sci."},{"year":"1991","author":"Pawlak","series-title":"Rough Sets","key":"10.1016\/j.knosys.2019.104938_b2"},{"key":"10.1016\/j.knosys.2019.104938_b3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-1996-272311","article-title":"Tolarence approximation spaces","volume":"27","author":"Skowron","year":"1996","journal-title":"Fund. Inform."},{"key":"10.1016\/j.knosys.2019.104938_b4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0888-613X(96)00071-0","article-title":"Two views of the theory of rough sets in finite universes","volume":"15","author":"Yao","year":"1996","journal-title":"Internat. J. Approx. Reason."},{"issue":"7","key":"10.1016\/j.knosys.2019.104938_b5","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1080\/019697298125470","article-title":"Rough set theory and its applications to data analysis","volume":"29","author":"Pawlak","year":"1998","journal-title":"Cybern. Syst."},{"issue":"1","key":"10.1016\/j.knosys.2019.104938_b6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0255(02)00197-4","article-title":"Rough sets and intelligent data analysis","volume":"147","author":"Pawlak","year":"2002","journal-title":"Inform. Sci."},{"issue":"1","key":"10.1016\/j.knosys.2019.104938_b7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ins.2006.06.003","article-title":"Rudiments of rough sets","volume":"177","author":"Pawlak","year":"2007","journal-title":"Inform. Sci."},{"key":"10.1016\/j.knosys.2019.104938_b8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ijar.2015.12.014","article-title":"Optimal approximations with rough sets and similarities in measure spaces","volume":"71","author":"Janicki","year":"2016","journal-title":"Internat. J. Approx. Reason."},{"issue":"6","key":"10.1016\/j.knosys.2019.104938_b9","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1016\/S0167-8655(02)00196-4","article-title":"Rough set methods in feature selection and recognition","volume":"24","author":"Swiniarski","year":"2003","journal-title":"Pattern Recognit. Lett."},{"year":"2000","author":"Polkowski","series-title":"Rough Set Methods and Applications","key":"10.1016\/j.knosys.2019.104938_b10"},{"issue":"2","key":"10.1016\/j.knosys.2019.104938_b11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1111\/j.1467-8640.1995.tb00035.x","article-title":"Learning in relational databases: A rough set approach","volume":"11","author":"Hu","year":"2010","journal-title":"Comput. Intell."},{"year":"1998","author":"Lingras","series-title":"Data Mining Using Extensions of the Rough Set Model","key":"10.1016\/j.knosys.2019.104938_b12"},{"issue":"3","key":"10.1016\/j.knosys.2019.104938_b13","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.knosys.2009.12.003","article-title":"A rough set approach for selecting clustering attribute","volume":"23","author":"Herawan","year":"2010","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2019.104938_b14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.knosys.2016.08.009","article-title":"Feature subset selection based on fuzzy neighborhood rough sets","volume":"111","author":"Wang","year":"2016","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2019.104938_b15","first-page":"1","article-title":"Resilience analysis of critical infrastructures: A cognitive approach based on granular computing","author":"Fujita","year":"2018","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.knosys.2019.104938_b16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.knosys.2018.05.019","article-title":"Related families-based attribute reduction of dynamic covering decision information systems","volume":"162","author":"Lang","year":"2018","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2019.104938_b17","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.ijar.2017.03.008","article-title":"Cost-sensitive sequential three-way decision modeling using a deep neural network","volume":"85","author":"Li","year":"2017","journal-title":"Internat. J. Approx. Reason."},{"key":"10.1016\/j.knosys.2019.104938_b18","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.knosys.2017.07.031","article-title":"A unified model of sequential three-way decisions and multilevel incremental processing","volume":"134","author":"Yang","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2019.104938_b19","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ijar.2018.04.012","article-title":"Approximations of arbitrary relations by partial orders","volume":"98","author":"Janicki","year":"2018","journal-title":"Internat. J. Approx. Reason."},{"issue":"3","key":"10.1016\/j.knosys.2019.104938_b20","first-page":"391","article-title":"A quick attribute reduction algorithm with complexity of max(O(|C||U|),O(|C|2|U\u2215C|))","volume":"29","author":"Xu","year":"2006","journal-title":"Chinese J. Comput."},{"issue":"Suppl. C","key":"10.1016\/j.knosys.2019.104938_b21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ins.2017.02.032","article-title":"Quick attribute reduction with generalized indiscernibility models","volume":"397\u2013398","author":"Jing","year":"2017","journal-title":"Inform. Sci."},{"issue":"7","key":"10.1016\/j.knosys.2019.104938_b22","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/j.ins.2008.11.020","article-title":"Discernibility matrix simplification for constructing attribute reducts","volume":"179","author":"Yao","year":"2009","journal-title":"Inform. Sci."},{"issue":"Suppl. C","key":"10.1016\/j.knosys.2019.104938_b23","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.knosys.2017.10.033","article-title":"Discernibility matrix based incremental attribute reduction for dynamic data","volume":"140","author":"Wei","year":"2018","journal-title":"Knowl.-Based Syst."},{"issue":"11","key":"10.1016\/j.knosys.2019.104938_b24","doi-asserted-by":"crossref","first-page":"1929","DOI":"10.1007\/s13042-017-0712-6","article-title":"Feature selection based on maximal neighborhood discernibility","volume":"9","author":"Wang","year":"2018","journal-title":"Int. J. Mach. Learn. Cybern."},{"issue":"1","key":"10.1016\/j.knosys.2019.104938_b25","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1016\/j.asoc.2012.07.018","article-title":"Attribute reduction for dynamic data sets","volume":"13","author":"Wang","year":"2013","journal-title":"Appl. Soft Comput."},{"issue":"Suppl. C","key":"10.1016\/j.knosys.2019.104938_b26","first-page":"1","article-title":"Feature selection in mixed data: A method using a novel fuzzy rough set-based information entropy","volume":"56","author":"Zhang","year":"2016","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.knosys.2019.104938_b27","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.knosys.2017.07.017","article-title":"A unified information measure for general binary relations","volume":"135","author":"Wang","year":"2017","journal-title":"Knowl.-Based Syst."},{"issue":"7","key":"10.1016\/j.knosys.2019.104938_b28","first-page":"2986","article-title":"Feature selection based on neighborhood discrimination index","volume":"29","author":"Wang","year":"2018","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.knosys.2019.104938_b29","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.ijar.2016.05.001","article-title":"An incremental attribute reduction approach based on knowledge granularity under the attribute generalization","volume":"76","author":"Jing","year":"2016","journal-title":"Internat. J. Approx. Reason."},{"key":"10.1016\/j.knosys.2019.104938_b30","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ins.2017.05.003","article-title":"An incremental attribute reduction approach based on knowledge granularity with a multi-granulation view","volume":"411","author":"Jing","year":"2017","journal-title":"Inform. Sci."},{"key":"10.1016\/j.knosys.2019.104938_b31","first-page":"1","article-title":"Neighbor inconsistent pair selection for attribute reduction by rough set approach","author":"Dai","year":"2017","journal-title":"IEEE Trans. Fuzzy Syst."},{"issue":"Suppl. C","key":"10.1016\/j.knosys.2019.104938_b32","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.ijar.2017.12.002","article-title":"A novel incremental attribute reduction approach for dynamic incomplete decision systems","volume":"93","author":"Xie","year":"2018","journal-title":"Internat. J. Approx. Reason."},{"issue":"1","key":"10.1016\/j.knosys.2019.104938_b33","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.cmpb.2013.10.007","article-title":"Supervised hybrid feature selection based on pso and rough sets for medical diagnosis","volume":"113","author":"Inbarani","year":"2014","journal-title":"Comput. Methods Programs Biomed."},{"issue":"Suppl. C","key":"10.1016\/j.knosys.2019.104938_b34","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.knosys.2015.02.002","article-title":"Finding rough set reducts with fish swarm algorithm","volume":"81","author":"Chen","year":"2015","journal-title":"Knowl.-Based Syst."},{"issue":"8","key":"10.1016\/j.knosys.2019.104938_b35","doi-asserted-by":"crossref","first-page":"1859","DOI":"10.1007\/s00521-015-1840-0","article-title":"A novel hybrid feature selection method based on rough set and improved harmony search","volume":"26","author":"Inbarani","year":"2015","journal-title":"Neural Comput. Appl."},{"issue":"22","key":"10.1016\/j.knosys.2019.104938_b36","doi-asserted-by":"crossref","first-page":"4928","DOI":"10.1016\/j.ins.2011.07.010","article-title":"Test-cost-sensitive attribute reduction","volume":"181","author":"Min","year":"2011","journal-title":"Inform. Sci."},{"issue":"1","key":"10.1016\/j.knosys.2019.104938_b37","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/JSEE.2012.00020","article-title":"Cooperative extended rough attribute reduction algorithm based on improved pso","volume":"23","author":"Ding","year":"2012","journal-title":"J. Syst. Eng. Electron."},{"issue":"3","key":"10.1016\/j.knosys.2019.104938_b38","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.ins.2012.08.020","article-title":"A novel and better fitness evaluation for rough set based minimum;attribute reduction problem","volume":"222","author":"Ye","year":"2013","journal-title":"Inform. Sci."},{"issue":"7","key":"10.1016\/j.knosys.2019.104938_b39","doi-asserted-by":"crossref","first-page":"1893","DOI":"10.1007\/s00500-014-1371-0","article-title":"A new approach to minimum attribute reduction based on discrete artificial bee colony","volume":"19","author":"Ye","year":"2015","journal-title":"Soft Comput."},{"issue":"6","key":"10.1016\/j.knosys.2019.104938_b40","doi-asserted-by":"crossref","first-page":"2233","DOI":"10.1007\/s00500-015-1638-0","article-title":"Minimal attribute reduction with rough set based on compactness discernibility information tree","volume":"20","author":"Jiang","year":"2016","journal-title":"Soft Comput."},{"issue":"7","key":"10.1016\/j.knosys.2019.104938_b41","first-page":"1867","article-title":"Complete minimum attribute reduction algorithm using fusion of rough equivalence class and tabu search","volume":"37","author":"Zhao","year":"2017","journal-title":"Syst. Eng. Theory Pract."},{"key":"10.1016\/j.knosys.2019.104938_b42","series-title":"Minimal Cost Attribute Reduction Through Backtracking","first-page":"100","author":"Min","year":"2011"},{"doi-asserted-by":"crossref","unstructured":"G. Pan, F. Min, W. Zhu, A genetic algorithm to the minimal test cost reduct problem, in: IEEE International Conference on Granular Computing, 2012, pp. 539\u2013544.","key":"10.1016\/j.knosys.2019.104938_b43","DOI":"10.1109\/GRC.2011.6122654"},{"issue":"11","key":"10.1016\/j.knosys.2019.104938_b44","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.ins.2013.06.057","article-title":"Test cost sensitive multigranulation rough set: Model and minimal cost selection","volume":"250","author":"Yang","year":"2013","journal-title":"Inform. Sci."},{"issue":"12","key":"10.1016\/j.knosys.2019.104938_b45","doi-asserted-by":"crossref","first-page":"4813","DOI":"10.1007\/s00500-015-1770-x","article-title":"Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model","volume":"20","author":"Fan","year":"2016","journal-title":"Soft Comput."},{"issue":"1, Part 2","key":"10.1016\/j.knosys.2019.104938_b46","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.ijar.2013.04.003","article-title":"Feature selection with test cost constraint","volume":"55","author":"Min","year":"2014","journal-title":"Internat. J. Approx. Reason."},{"issue":"Suppl. C","key":"10.1016\/j.knosys.2019.104938_b47","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.knosys.2016.04.002","article-title":"Discrete particle swarm optimization approach for cost sensitive attribute reduction","volume":"102","author":"Dai","year":"2016","journal-title":"Knowl.-Based Syst."},{"issue":"20","key":"10.1016\/j.knosys.2019.104938_b48","doi-asserted-by":"crossref","first-page":"6159","DOI":"10.1007\/s00500-016-2173-3","article-title":"A set-cover-based approach for the test-cost-sensitive attribute reduction problem","volume":"21","author":"Tan","year":"2017","journal-title":"Soft Comput."},{"key":"10.1016\/j.knosys.2019.104938_b49","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.jocs.2017.05.007","article-title":"Ant colony optimization with partial-complete searching for attribute reduction","volume":"25","author":"Min","year":"2018","journal-title":"J. Comput. Sci."},{"key":"10.1016\/j.knosys.2019.104938_b50","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.asoc.2017.12.023","article-title":"Test-cost-sensitive rough set based approach for minimum weight vertex cover problem","volume":"64","author":"Xie","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.knosys.2019.104938_b51","series-title":"Rough Sets and Knowledge Technology","first-page":"642","article-title":"Three-way decision: An interpretation of rules in rough set theory","author":"Yao","year":"2009"},{"key":"10.1016\/j.knosys.2019.104938_b52","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.ijar.2018.11.014","article-title":"Cost-sensitive three-way class-specific attribute reduction","volume":"105","author":"Ma","year":"2019","journal-title":"Internat. J. Approx. Reason."},{"key":"10.1016\/j.knosys.2019.104938_b53","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.ijar.2018.11.003","article-title":"Cost-sensitive approximate attribute reduction with three-way decisions","volume":"104","author":"Fang","year":"2019","journal-title":"Internat. J. Approx. Reason."},{"key":"10.1016\/j.knosys.2019.104938_b54","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ijar.2018.10.017","article-title":"Cost-sensitive feature selection via the \u21132,1-norm","volume":"104","author":"Zhao","year":"2019","journal-title":"Internat. J. Approx. Reason."},{"key":"10.1016\/j.knosys.2019.104938_b55","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.knosys.2018.05.020","article-title":"Multi-granularity feature selection on cost-sensitive data with measurement errors and variable costs","volume":"158","author":"Liao","year":"2018","journal-title":"Knowl.-Based Syst."},{"issue":"3","key":"10.1016\/j.knosys.2019.104938_b56","doi-asserted-by":"crossref","first-page":"1323","DOI":"10.1109\/TIP.2017.2781298","article-title":"Cost-sensitive feature selection by optimizing f-measures","volume":"27","author":"Liu","year":"2018","journal-title":"IEEE Trans. Image Process."},{"issue":"2","key":"10.1016\/j.knosys.2019.104938_b57","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/5254.671091","article-title":"Feature subset selection using a genetic algorithm","volume":"13","author":"Yang","year":"2002","journal-title":"IEEE Intell. Syst. Appl."},{"key":"10.1016\/j.knosys.2019.104938_b58","series-title":"Handbook of Metaheuristics","first-page":"250","article-title":"Metaheuristic: Algorithms, applications, and advances","author":"Dorigo","year":"2003"},{"issue":"9","key":"10.1016\/j.knosys.2019.104938_b59","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1016\/j.patrec.2008.02.006","article-title":"An efficient ant colony optimization approach to attribute reduction in rough set theory","volume":"29","author":"Ke","year":"2008","journal-title":"Pattern Recognit. Lett."},{"year":"2011","author":"Kennedy","series-title":"Particle Swarm Optimization","key":"10.1016\/j.knosys.2019.104938_b60"},{"issue":"6","key":"10.1016\/j.knosys.2019.104938_b61","doi-asserted-by":"crossref","first-page":"1656","DOI":"10.1109\/TSMCB.2012.2227469","article-title":"Particle swarm optimization for feature selection in classification: A multi-objective approach","volume":"43","author":"Xue","year":"2013","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.knosys.2019.104938_b62","series-title":"Foundations of Fuzzy Logic and Soft Computing","first-page":"789","article-title":"Artificial bee colony (abc) optimization algorithm for solving constrained optimization problems","author":"Karaboga","year":"2007"},{"key":"10.1016\/j.knosys.2019.104938_b63","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/j.ins.2017.09.028","article-title":"Pareto front feature selection based on artificial bee colony optimization","volume":"422","author":"Hancer","year":"2018","journal-title":"Inform. Sci."},{"issue":"4","key":"10.1016\/j.knosys.2019.104938_b64","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1007\/s10462-012-9342-2","article-title":"Artificial fish swarm algorithm: a survey of the state-of-the-art, hybridization, combinatorial and indicative applications","volume":"42","author":"Neshat","year":"2014","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.knosys.2019.104938_b65","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/j.neucom.2015.06.090","article-title":"A novel attribute reduction algorithm based on rough set and improved artificial fish swarm algorithm","volume":"174","author":"Luan","year":"2016","journal-title":"Neurocomputing"},{"key":"10.1016\/j.knosys.2019.104938_b66","series-title":"A New Metaheuristic Bat-Inspired Algorithm","first-page":"65","author":"Yang","year":"2010"},{"issue":"5","key":"10.1016\/j.knosys.2019.104938_b67","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1504\/IJBIC.2011.042259","article-title":"Bat algorithm for multi-objective optimisation","volume":"3","author":"Yang","year":"2012","journal-title":"Int. J. Bio. Inspir. Comput."},{"issue":"6","key":"10.1016\/j.knosys.2019.104938_b68","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1007\/s00521-012-1028-9","article-title":"Bat algorithm for constrained optimization tasks","volume":"22","author":"Gandomi","year":"2013","journal-title":"Neural Comput. Appl."},{"issue":"3","key":"10.1016\/j.knosys.2019.104938_b69","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1504\/IJBIC.2013.055093","article-title":"Bat algorithm: literature review and applications","volume":"5","author":"Yang","year":"2013","journal-title":"Int. J. Bio. Inspir. Comput."},{"issue":"17","key":"10.1016\/j.knosys.2019.104938_b70","doi-asserted-by":"crossref","first-page":"6350","DOI":"10.1016\/j.eswa.2015.04.026","article-title":"A novel bat algorithm with habitat selection and doppler effect in echoes for optimization","volume":"42","author":"Meng","year":"2015","journal-title":"Expert Syst. Appl. Int. J."},{"doi-asserted-by":"crossref","unstructured":"R.Y.M. Nakamura, L.A.M. Pereira, D. Rodrigues, K.A.P. Costa, J.P. Papa, X.-S. Yang, 9 \u2013binary bat algorithm for feature selection, in: Swarm Intelligence and Bio-Inspired Computation, 2013, pp. 225\u2013237.","key":"10.1016\/j.knosys.2019.104938_b71","DOI":"10.1016\/B978-0-12-405163-8.00009-0"},{"issue":"3\u20134","key":"10.1016\/j.knosys.2019.104938_b72","first-page":"663","article-title":"Binary bat algorithm","volume":"25","author":"Mirjalili","year":"2013","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.knosys.2019.104938_b73","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.measurement.2016.09.031","article-title":"Optimal pmu placement for power system observability using taguchi binary bat algorithm","volume":"95","author":"Basetti","year":"2017","journal-title":"Measurement"},{"issue":"Suppl. C","key":"10.1016\/j.knosys.2019.104938_b74","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ins.2014.10.014","article-title":"Reliable fault diagnosis for incipient low-speed bearings using fault feature analysis based on a binary bat algorithm","volume":"294","author":"Kang","year":"2015","journal-title":"Inform. Sci."},{"issue":"8","key":"10.1016\/j.knosys.2019.104938_b75","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1016\/j.knosys.2011.06.007","article-title":"A dynamic attribute reduction algorithm based on 0-1 integer programming","volume":"24","author":"Xu","year":"2011","journal-title":"Knowl.-Based Syst."},{"issue":"4","key":"10.1016\/j.knosys.2019.104938_b76","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.knosys.2019.104938_b77","series-title":"HandBook of Applied Optimization, Vol. 2241","first-page":"65","article-title":"Branch-and-cut algorithms for combinatorial optimization problems","author":"Mitchell","year":"2002"},{"key":"10.1016\/j.knosys.2019.104938_b78","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.eswa.2015.10.013","article-title":"A branch-and-cut approach for the vehicle routing problem with loading constraints","volume":"47","author":"Hokama","year":"2016","journal-title":"Expert Syst. Appl."},{"unstructured":"UCI machine learning repository. http:\/\/www.ics.uci.edu\/mlearn\/MLRepository.html.","key":"10.1016\/j.knosys.2019.104938_b79"},{"key":"10.1016\/j.knosys.2019.104938_b80","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1214\/aoms\/1177731944","article-title":"A comparison of alternative tests of significance for the problem of m rankings","volume":"11","author":"Friedman","year":"1940","journal-title":"Ann. Math. Statist."},{"year":"1963","author":"Nemenyi","series-title":"Distribution-Free Multiple Comparisons","key":"10.1016\/j.knosys.2019.104938_b81"},{"unstructured":"J. Li, K. Cheng, S. Wang, F. Morstatter, T. Robert, J. Tang, H. Liu, Feature selection: A data perspective, arXiv:1601.07996.","key":"10.1016\/j.knosys.2019.104938_b82"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095070511930379X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095070511930379X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T07:47:46Z","timestamp":1575532066000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S095070511930379X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":82,"alternative-id":["S095070511930379X"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2019.104938","relation":{},"ISSN":["0950-7051"],"issn-type":[{"type":"print","value":"0950-7051"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A novel test-cost-sensitive attribute reduction approach using the binary bat algorithm","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2019.104938","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"104938"}}