클래스 불균형 데이터의 효과적인 분류를 위한 k-NN과 생성적 적대 신경망 기반의 오버 샘플링Oversampling Based on k-NN and GAN for Effective Classification of Class Imbalance Dataset
- Other Titles
- Oversampling Based on k-NN and GAN for Effective Classification of Class Imbalance Dataset
- Authors
- 박지수; 안길승; 허선
- Issue Date
- Aug-2020
- Publisher
- 대한산업공학회
- Keywords
- N; Class Imbalance Dataset; Classifiers; Oversampling; GAN; k-Nearest Neighbor
- Citation
- 대한산업공학회지, v.46, no.4, pp 365 - 371
- Pages
- 7
- Indexed
- KCI
- Journal Title
- 대한산업공학회지
- Volume
- 46
- Number
- 4
- Start Page
- 365
- End Page
- 371
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/1627
- DOI
- 10.7232/JKIIE.2020.46.4.365
- ISSN
- 1225-0988
- Abstract
- Class imbalanced dataset is common in real world and may degrade the performance of the classifier. To address this, oversampling method that artificially creates the samples of minority class is adopted but is known to be ineffective for the high-dimensional dataset because it generates the samples whose distribution is far different from that of existing samples. Novel oversampling methods based on the generative adversarial networks (GAN) have been recently developed, but generated samples may have different degrees of impact on the performance of the classifier. Therefore, more efficient method that can capture the characteristics of the generated samples and select those samples that will be used to train and improve the performance of the classifier is necessary. This study proposes a GAN-based new oversampling method which generates artificial samples based on the distribution of existing minority class samples and extracts only those which are effective to expand the realm of samples of minority class using the k-nearest neighbor. We show the proposed method outperforms existing methods with respect to F1-measure by several illustrative datasets.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > DEPARTMENT OF INDUSTRIAL & MANAGEMENT ENGINEERING > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.