Browse > Article
http://dx.doi.org/10.3745/KTSDE.2016.5.10.483

Prototype-Based Classification Using Class Hyperspheres  

Lee, Hyun-Jong (단국대학교 컴퓨터과학과)
Hwang, Doosung (단국대학교 소프트웨어학과)
Publication Information
KIPS Transactions on Software and Data Engineering / v.5, no.10, 2016 , pp. 483-488 More about this Journal
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.
Keywords
Prototype Selection; Nearest-Neighbor Rule; Set Covering Optimization; Greedy Algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 X. Wu et al., "The top ten algorithms in data mining," CRC Press, 2009.
2 Trevor Hastie, Robert Tibshirani, and Jerome Friedman, "The elements of statistical learning: data mining," Inference, and Prediction, Springer Series in Statistics, 2001.
3 Jose Arturo Olvera-Lopez, Jesus Ariel Carrasco-Ochoa, Jose Francisco Martinez Trinidad, and Josef Kittler, "A review of instance selection methods," Artif. Intell. Rev, Vol.34, No.2, pp.133-143, 2010.   DOI
4 S. Garcia, J. Derrac, J. R. Cano, and F. Herrera, "Prototype selection for nearest neighbor classification : taxonomy and empirical study," IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol.34, No.3, pp.417-435, 2012.   DOI
5 D. S. Hwang and D. W. Kim, "Near-boundary data selection for fast support vector machines," Malaysian Journal of Computer Science, Vol.25, No.1, pp.23-37, 2012.
6 Fabrizio Angiulli, "Fast nearest neighbor condensation for large data sets classification," IEEE Transactions on Knowledge and Data Engineering, Vol.19, No.11, pp.1450-1464, 2007.   DOI
7 D. Randall Wilson and Tony R. Martinez, "Reduction techniques for instance-based learning algorithms," Machine Learning, Vol.38, No.3, pp.257-286, 2000.   DOI
8 Jacob Bien and Robert Tibshirani, "Prototype selection for interpretable classification," The Annuals of Applied Statistics, Vol.5, No.4, pp.2403-2424, 2011.   DOI
9 Ichigaku Takigawa, Mineichi Kudo, and Atsuyoshi Nakamura, "Convex sets as prototypes for classifying patterns," Engineering Applications of Artificial Intelligence, Vol.22, No.1, pp.101-108, 2009.   DOI
10 David Marchette, "Class cover catch digraphs," Wiley Interdisciplinary Reviews : Computational Statistics, Vol.2, No.2, pp.171-177, 2010.   DOI
11 Reda Younsi and Anthony Bagnall, "An efficient randomised sphere cover classifier," International Journal of Data Mining, Modelling and Management, Vol.4, No.2, pp.156-171, 2012.   DOI
12 S. Salzberg, "A nearest hyperrectangle learning method," Machine Learning, Vol.6, pp.251-276, 1991.
13 J. Hamidzadeh, R. Monsefi, and H. S. Yazdi, "IRAHC: instance reduction algorithm using hyperrectangle clustering," Pattern Recognition, Vol.48, No.5, pp.1878-1889, 2015.   DOI
14 Vijay V. Vazirani, Approximation Algorithms, Berlin: Springer, New York, 2001.
15 GLPK, "The GLPK Linear Programming Kit Package."
16 K. Bache and M. Lichman, "UCI Machine Learning Repository," University of California, School of Information and Computer Science., 2013.
17 B. H. Baek et al., "System design and implementation for recognizing and playing guitar tab chords," Korea Information Processing Society, Vol.22, No.2, pp.119-112. 2015.