{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T12:02:47Z","timestamp":1747224167160,"version":"3.40.5"},"reference-count":29,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"abstract":"<jats:p>Instance selection and feature selection are important steps in the data mining process. They help reduce the excessive number of instances and features. The purpose of this reduction is to eliminate the noisy and redundant instances and features in order to improve the classifiers performance. Various related works in the literature proves that metaheuristics can resolve the problem of instance and feature selection. In this article, the authors propose a new instance selection approach based on a Multi- Verse Optimizer algorithm (MVOIS), to reduce the run time and improve the performance of the one nearest neighbor classifier (1NN). This article tested the proposed approach on 31 datasets from the UCI repository and performed three more pre-process ISFS, FS and FSIS. The comparative study illustrates the efficiency of ISFS and FSIS compared to FS and IS. ISFS achieved 100% accuracy for labor and iris datasets.<\/jats:p>","DOI":"10.4018\/ijsita.2018040103","type":"journal-article","created":{"date-parts":[[2018,9,28]],"date-time":"2018-09-28T18:57:33Z","timestamp":1538161053000},"page":"35-49","source":"Crossref","is-referenced-by-count":5,"title":["A Multi-Verse Optimizer Approach for Instance Selection and Optimizing 1-NN Algorithm"],"prefix":"10.4018","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8683-3163","authenticated-orcid":true,"given":"Nassima","family":"Dif","sequence":"first","affiliation":[{"name":"Djillali Liabes University, Sidi Belabbes, Algeria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3391-6280","authenticated-orcid":true,"given":"Zakaria","family":"Elberrichi","sequence":"additional","affiliation":[{"name":"Djillali Liabes University, EEDIS Laboratory, Sidi Belabbes, Algeria"}]}],"member":"2432","reference":[{"key":"IJSITA.2018040103-0","doi-asserted-by":"publisher","DOI":"10.1007\/BF00153759"},{"key":"IJSITA.2018040103-1","doi-asserted-by":"publisher","DOI":"10.1109\/HSI.2013.6577843"},{"key":"IJSITA.2018040103-2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.07.301"},{"journal-title":"Population-based incremental learning. a method for integrating genetic search based function optimization and competitive learning","year":"1994","author":"S.Baluja","key":"IJSITA.2018040103-3"},{"key":"IJSITA.2018040103-4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014043630878"},{"key":"IJSITA.2018040103-5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.819265"},{"key":"IJSITA.2018040103-6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054155"},{"key":"IJSITA.2018040103-7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.09.028"},{"key":"IJSITA.2018040103-8","doi-asserted-by":"crossref","unstructured":"Eshelman, L. J. (1991). The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In Foundations of genetic algorithms (Vol. 1, pp. 265-283).","DOI":"10.1016\/B978-0-08-050684-5.50020-3"},{"key":"IJSITA.2018040103-9","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-008-0106-1"},{"key":"IJSITA.2018040103-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.02.006"},{"key":"IJSITA.2018040103-11","unstructured":"He, H., Bai, Y., Garcia, E. A., & Li, S. (2008, June). ADASYN: Adaptive synthetic sampling approach for imbalanced learning. In IEEE International Joint Conference on Neural Networks IJCNN 2008 (pp. 1322-1328). IEEE."},{"key":"IJSITA.2018040103-12","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-003-0191-0"},{"key":"IJSITA.2018040103-13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.11.004"},{"key":"IJSITA.2018040103-14","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1870-7"},{"key":"IJSITA.2018040103-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.08.015"},{"key":"IJSITA.2018040103-16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75175-5_4"},{"key":"IJSITA.2018040103-17","first-page":"153","article-title":"Prototype selection via prototype relevance","author":"J. A.Olvera-L\u00f3pez","year":"2008","journal-title":"Iberoamerican Congress on Pattern Recognition"},{"key":"IJSITA.2018040103-18","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-010-9165-y"},{"key":"IJSITA.2018040103-19","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2000.906011"},{"key":"IJSITA.2018040103-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.01.003"},{"key":"IJSITA.2018040103-21","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(02)00119-X"},{"key":"IJSITA.2018040103-22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2013.12.034"},{"key":"IJSITA.2018040103-23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2012.11.005"},{"key":"IJSITA.2018040103-24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.03.032"},{"key":"IJSITA.2018040103-25","unstructured":"Whitley, L. D. (1989, June). The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best. In ICGA (Vol. 89, pp. 116-123)."},{"key":"IJSITA.2018040103-26","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1972.4309137"},{"key":"IJSITA.2018040103-27","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007626913721"},{"key":"IJSITA.2018040103-28","doi-asserted-by":"publisher","DOI":"10.1145\/2464576.2466809"}],"container-title":["International Journal of Strategic Information Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=215443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T06:17:10Z","timestamp":1651817830000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJSITA.2018040103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":29,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.4018\/ijsita.2018040103","relation":{},"ISSN":["1947-3095","1947-3109"],"issn-type":[{"type":"print","value":"1947-3095"},{"type":"electronic","value":"1947-3109"}],"subject":[],"published":{"date-parts":[[2018,4]]}}}