클래스 초월구를 이용한 프로토타입 기반 분류
Prototype-Based Classification Using Class Hyperspheres
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
본 논문은 최근접 이웃 규칙을 이용한 프로토타입을 이용하는 분류 학습을 제안한다. 훈련 데이터가 대표하는 클래스 영역을 초월구로 분할하는데 최근접 이웃규칙을 적용시키며, 초월구는 동일 클래스 데이터들만 포함시킨다. 초월구의 반지름은 가장 인접한 다른 클래스 데이터와 가장 먼 동일 클래스 데이터의 중간 거리 값으로 결정한다. 그리고 전체 훈련 데이터를 대표하는 최소의 프로토타입 집합을 선택하기 위해 집합 덮개 최적화를 이용한다. 제안하는 선택 방법은 클래스 별 프로토타입을 선택하는 그리디 알고리즘으로 설계되며, 대규모 훈련 데이터에 대한 병렬처리가 가능하다. 분류 예측은 최근접 이웃 규칙을 이용하며, 새로운 훈련 데이터는 프로토타입 집합이다. 실험에서 제안하는 방법은 기연구된 학습 방법에 비해 일반화 성능이 우수하다.
Abstract
In this paper, we propose a prototype-based classification learning by using the nearest-neighbor rule. The nearest-neighbor is applied to segment the class area of all the training data with hyperspheres, and a hypersphere must cover the data from the same class. The radius of a hypersphere is computed by the mid point of the two distances to the farthest same class point and the nearest other class point. And we transform the prototype selection problem into a set covering problem in order to determine the smallest set of prototypes that cover all the training data. The proposed prototype selection method is designed by a greedy algorithm and applicable to process a large-scale training set in parallel. The prediction rule is the nearest-neighbor rule and the new training data is the set of prototypes. In experiments, the generalization performance of the proposed method is superior to existing methods.
참고문헌 (17)
- X. Wu, "The top ten algorithms in data mining" (2009), CRC Press
- Trevor Hastie, "Inference, and Prediction" (2001), Springer Series in Statistics
- Jose Arturo Olvera-Lopez, "A review of instance selection methods", Artif. Intell. Rev, 34(2), pp.133~143 (2010)
- S. Garcia, "Prototype selection for nearest neighbor classification : taxonomy and empirical study", IEEE Transactions on Pattern Analysis and Machine Intelligence, 34(3), pp.417~435 (2012)
- D. S. Hwang, "Near-boundary data selection for fast support vector machines", Malaysian Journal of Computer Science, 25(1), pp.23~37 (2012)
- Fabrizio Angiulli, "Fast nearest neighbor condensation for large data sets classification", IEEE Transactions on Knowledge and Data Engineering, 19(11), pp.1450~1464 (2007)
- D. Randall Wilson, "Reduction techniques for instance-based learning algorithms", Machine Learning, 38(3), pp.257~286 (2000)
- Jacob Bien, "Prototype selection for interpretable classification", The Annuals of Applied Statistics, 5(4), pp.2403~2424 (2011)
- Ichigaku Takigawa, "Convex sets as prototypes for classifying patterns", Engineering Applications of Artificial Intelligence, 22(1), pp.101~108 (2009)
- David Marchette, "Class cover catch digraphs", Wiley Interdisciplinary Reviews : Computational Statistics, 2(2), pp.171~177 (2010)
- Reda Younsi, "An efficient randomised sphere cover classifier", International Journal of Data Mining, Modelling and Management, 4(2), pp.156~171 (2012)
- S. Salzberg, "A nearest hyperrectangle learning method", Machine Learning, 6, pp.251~276 (1991)
- J. Hamidzadeh, "IRAHC : instance reduction algorithm using hyperrectangle clustering", Pattern Recognition, 48(5), pp.1878~1889 (2015)
- Vijay V. Vazirani, "Approximation Algorithms" (2001), Springer
- GLPK, "The GLPK Linear Programming Kit Package", ~
- UCI Machine Learning Repository, "K. Bache", University of California, School of Information and Computer Science, ~ (2013)
- B. H. Baek, "System design and implementation for recognizing and playing guitar tab chords", Korea Information Processing Society, 22(2), pp.119~112 (2015)