[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/igg/jsita0/v9y2018i2p35-49.html
   My bibliography  Save this article

A Multi-Verse Optimizer Approach for Instance Selection and Optimizing 1-NN Algorithm

Author

Listed:
  • Nassima Dif

    (Djillali Liabes University, Sidi Belabbes, Algeria)

  • Zakaria Elberrichi

    (Djillali Liabes University, EEDIS Laboratory, Sidi Belabbes, Algeria)

Abstract
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.

Suggested Citation

  • Nassima Dif & Zakaria Elberrichi, 2018. "A Multi-Verse Optimizer Approach for Instance Selection and Optimizing 1-NN Algorithm," International Journal of Strategic Information Technology and Applications (IJSITA), IGI Global, vol. 9(2), pages 35-49, April.
    • Handle: RePEc:igg:jsita0:v:9:y:2018:i:2:p:35-49
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSITA.2018040103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jsita0:v:9:y:2018:i:2:p:35-49. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.