IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7852456.html
   My bibliography  Save this article

Density-Based Geometric One-Class Classifier Combined with Genetic Algorithm

Author

Listed:
  • Do Gyun Kim
  • Jin Young Choi
  • Sotiris B. Kotsiantis

Abstract

One of the most prospective issues in recent machine learning research is one-class classification (OCC), which considers datasets composed of only one class and outlier. It is more reasonable than the traditional multiclass classification in dealing with problematic datasets or special cases. Generally, classification accuracy and interpretability for users are considered to have a trade-off in OCC methods. A classifier based on hyperrectangle (H-RTGL) can alleviate such a trade-off and uses H-RTGL formulated by the conjunction of geometric rules (called an interval). This interval can form a basis for interpretability since it can be easily understood by the user. However, the existing H-RTGL-based OCC classifiers have the following limitations: (i) they cannot reflect the density of the target class, (ii) the density is considered using a primitive interval generation method, and (iii) there exists no systematic procedure for determining the hyperparameter of the H-RTGL-based OCC classifier, which influences its classification performance. Therefore, we suggest a one-class hyperrectangle descriptor based on density 1−HRDd with a more elaborate interval generation method, including parametric and nonparametric approaches. Specifically, we design a genetic algorithm that comprises a chromosome structure and genetic operators for systematic generation of 1−HRDd through optimization of the hyperparameter. Our study is validated through a numerical experiment using several actual datasets with different sizes and features, and the result is compared to the existing OCC algorithms along with other H-RTGL-based classifiers.

Suggested Citation

  • Do Gyun Kim & Jin Young Choi & Sotiris B. Kotsiantis, 2022. "Density-Based Geometric One-Class Classifier Combined with Genetic Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-18, April.
  • Handle: RePEc:hin:jnlmpe:7852456
    DOI: 10.1155/2022/7852456
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/7852456.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/7852456.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/7852456?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:hin:jnlmpe:7852456. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.