{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T20:07:14Z","timestamp":1720296434587},"reference-count":29,"publisher":"Elsevier BV","content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1016\/j.cie.2013.10.009","type":"journal-article","created":{"date-parts":[[2013,11,11]],"date-time":"2013-11-11T20:45:34Z","timestamp":1384202734000},"page":"160-167","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"special_numbering":"C","title":["An Exponential Monte-Carlo algorithm for feature selection problems"],"prefix":"10.1016","volume":"67","author":[{"given":"Salwani","family":"Abdullah","sequence":"first","affiliation":[]},{"given":"Nasser R.","family":"Sabar","sequence":"additional","affiliation":[]},{"given":"Mohd Zakree","family":"Ahmad Nazri","sequence":"additional","affiliation":[]},{"given":"Masri","family":"Ayob","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cie.2013.10.009_b0005","unstructured":"Abdullah, S., & Jaddi, N. S. (2010). Great deluge algorithm for rough set attribute reduction. In Y. Zhang, A. Cuzzocrea, J. Ma, K. -I. Chung, T. Arslan, & X. Song (Eds.), Communications in computer and information science, 1. Database theory and application, bio-science and bio-technology (Vol. 118, pp. 189\u2013197). Berlin Heidelberg New York: Springer. ISBN: 978-3-642-17621-0."},{"key":"10.1016\/j.cie.2013.10.009_b0010","unstructured":"Abdullah, S., Burke, E. K., McCollum, B. (2005). An investigation of variable neighbourhood search for the course timetabling problem. In The 2nd multidisciplinary international conference on scheduling: Theory and applications (MISTA) (pp. 413\u2013427). New York, July 18\u201321, 2005."},{"key":"10.1016\/j.cie.2013.10.009_b0015","doi-asserted-by":"crossref","unstructured":"Abdullah, S., Burke, E. K., & McCollum, B. (2007). Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem. In K. F. Doerner, M. Gendreau, P. Greistorfer, W. J. Gutjahr, R. F. Hartl, & M. Reimann (Eds.), Metaheuristics \u2013 Progress in complex systems optimization. Computer Science Interfaces Book Series (Vol. 39, pp. 153\u2013169). Springer Operations Research. ISBN-13:978-0-387-71919-1","DOI":"10.1007\/978-0-387-71921-4_8"},{"key":"10.1016\/j.cie.2013.10.009_b0020","first-page":"1032","article-title":"A constructive hyper-heuristics for rough set attribute reduction","volume":"2010","author":"Abdullah","year":"2010","journal-title":"ISDA"},{"issue":"10","key":"10.1016\/j.cie.2013.10.009_b0025","doi-asserted-by":"crossref","first-page":"6562","DOI":"10.1073\/pnas.102102699","article-title":"Selection bias in gene extraction on the basis of microarray gene-expression data","volume":"99","author":"Ambroise","year":"2002","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"10.1016\/j.cie.2013.10.009_b0030","first-page":"1015","article-title":"Hybrid variable neighbourhood search algorithm for attribute reduction in rough set theory","volume":"2010","author":"Arajy","year":"2010","journal-title":"ISDA"},{"key":"10.1016\/j.cie.2013.10.009_b0035","unstructured":"Ayob, M. & Kendall, G. (2003). A Monte Carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine. In Proc. of the international conference on intelligent technologies, InTech\u201903, Chiang Mai (pp. 17\u201319)."},{"key":"10.1016\/j.cie.2013.10.009_b0040","series-title":"UCI repository of machine learning databases","author":"Blake","year":"1998"},{"key":"10.1016\/j.cie.2013.10.009_b0045","doi-asserted-by":"crossref","first-page":"2976","DOI":"10.1016\/j.csda.2010.03.004","article-title":"Measuring the prediction error. A comparison of cross-validation, bootstrap and covariance penalty methods","volume":"54","author":"Borra","year":"2010","journal-title":"Computational Statistics and Data Analysis"},{"key":"10.1016\/j.cie.2013.10.009_b0050","unstructured":"Han, J., & Kamber, M. (2006). Data mining: Concepts and techniques. In J. Gray (Series Ed.), The Morgan Kaufmann series in data management systems (2nd ed.). Morgan Kaufmann Publishers, March 2006. ISBN 1-55860-901-6."},{"issue":"9","key":"10.1016\/j.cie.2013.10.009_b0055","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1007\/s00500-007-0260-1","article-title":"Tabu search for attribute reduction in rough set theory","volume":"12","author":"Hedar","year":"2008","journal-title":"Soft Computing"},{"key":"10.1016\/j.cie.2013.10.009_b0060","first-page":"49","article-title":"Nonlinear great deluge algorithm for rough set attribute reduction","volume":"29","author":"Jaddi","year":"2013","journal-title":"Journal of Information Science and Engineering"},{"key":"10.1016\/j.cie.2013.10.009_b0065","doi-asserted-by":"crossref","DOI":"10.3906\/elk-1202-113","article-title":"Hybrid of genetic algorithm and great deluge for rough set attribute reduction","author":"Jaddi","year":"2013","journal-title":"Turkish Journal of Electrical Engineering and Computer Sciences"},{"key":"10.1016\/j.cie.2013.10.009_b0070","unstructured":"Jensen, R., & Shen, Q. (2003). Finding rough set reducts with ant colony optimization. In Proceedings of the 2003 UK workshop on computational intelligence (pp. 15\u201322)."},{"issue":"12","key":"10.1016\/j.cie.2013.10.009_b0075","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1109\/TKDE.2004.96","article-title":"Semantics-preserving dimensionality reduction: Rough and fuzzy-rough-based approaches","volume":"16","author":"Jensen","year":"2004","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.cie.2013.10.009_b0080","first-page":"1183","article-title":"Investigating composite neighbourhood structure for attribute reduction in rough set theory","volume":"2010","author":"Jihad","year":"2010","journal-title":"ISDA"},{"key":"10.1016\/j.cie.2013.10.009_b0085","first-page":"531","article-title":"Scatter search for rough set attribute reduction","volume":"1","author":"Jue","year":"2009","journal-title":"Computational Sciences and Optimization 2009, CSO 2009"},{"issue":"9","key":"10.1016\/j.cie.2013.10.009_b0090","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 Recognition Letters"},{"key":"10.1016\/j.cie.2013.10.009_b0095","doi-asserted-by":"crossref","DOI":"10.1080\/00207721.2013.791000","article-title":"Fuzzy record to record travel algorithm in solving rough set attribute reduction","author":"Mafarja","year":"2013","journal-title":"International Journal of Systems Science"},{"issue":"3","key":"10.1016\/j.cie.2013.10.009_b0100","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1504\/IJCAT.2013.056915","article-title":"Investigating memetic algorithm in solving rough set attribute reduction","volume":"48","author":"Mafarja","year":"2013","journal-title":"International Journal of Computer Applications in Technology"},{"issue":"1993","key":"10.1016\/j.cie.2013.10.009_b0105","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.cie.2013.10.009_b0110","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0969-6016(94)90032-9","article-title":"Capacitated clustering problems by hybrid simulated annealing and tabu search","volume":"1994","author":"Osman","year":"1994","journal-title":"International Transactions in Operational Research I"},{"issue":"11","key":"10.1016\/j.cie.2013.10.009_b0115","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","article-title":"Rough sets","author":"Pawlak","year":"1982","journal-title":"International Journal of Computer and Information Sciences"},{"key":"10.1016\/j.cie.2013.10.009_b0120","series-title":"Rough sets: Theoretical aspects of reasoning about data","author":"Pawlak","year":"1991"},{"key":"10.1016\/j.cie.2013.10.009_b0125","doi-asserted-by":"crossref","unstructured":"Sabar, N. R., Ayob, M., & Kendall, G. (2009). Tabu exponential Monte-Carlo with counter heuristic for examination timetabling. In Proceedings of 2009 IEEE Symposium on Computational Intelligence in Scheduling (CISched2009), 2009a (pp. 90\u201394). Nashville, Tennessee, USA.","DOI":"10.1109\/SCIS.2009.4927020"},{"key":"10.1016\/j.cie.2013.10.009_b0130","series-title":"Advances in the Dempster\u2013Shafer theory of evidence","first-page":"193","article-title":"From rough set theory to evidence theory","author":"Skowron","year":"1994"},{"issue":"1","key":"10.1016\/j.cie.2013.10.009_b0135","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/j.cie.2013.10.009_b0140","unstructured":"Wroblewski, J. (1995). Finding minimal reducts using genetic algorithms. In Proc. second ann. joint conf. information sciences (pp. 186\u2013189)."},{"issue":"2","key":"10.1016\/j.cie.2013.10.009_b0145","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/s11432-007-0017-6","article-title":"A general approach to attribute reduction in rough set theory","volume":"50","author":"Zhang","year":"2007","journal-title":"Science in China Series F: Information Sciences"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835213003380?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835213003380?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T09:30:25Z","timestamp":1564651825000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835213003380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":29,"alternative-id":["S0360835213003380"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2013.10.009","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2014,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An Exponential Monte-Carlo algorithm for feature selection problems","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2013.10.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}