Advanced SearchSearch Tips
Prototype based Classification by Generating Multidimensional Spheres per Class Area
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Prototype based Classification by Generating Multidimensional Spheres per Class Area
Shim, Seyong; Hwang, Doosung;
  PDF(new window)
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 into spheres within which the data exist from the same class. Prototypes are the center of spheres and their radii are computed by the mid-point of the two distances to the farthest same class point and the nearest another class point. And we transform the prototype selection problem into a set covering problem in order to determine the smallest set of prototypes that include all the training data. The proposed prototype selection method is based on a greedy algorithm that is applicable to the training data per class. The complexity of the proposed method is not complicated and the possibility of its parallel implementation is high. The prototype-based classification learning takes up the set of prototypes and predicts the class of test data by the nearest neighbor rule. In experiments, the generalization performance of our prototype classifier is superior to those of the nearest neighbor, Bayes classifier, and another prototype classifier.
Prototype selection;Nearest-neighbor rule;Classification learning;Set covering optimization;Greedy algorithm;
 Cited by
X. Wu et al., "The top ten algorithms in data mining," CRC Press, 2009.

T. Hastie, R. Tibshirani, and J. Friedman, "The Elements of Statistical Learning: Data Mining," Inference, and Prediction, Springer Series in Statistics, 2001.

J. Arturo Olvera-Lopez, J. Ariel Carrasco-Ochoa, J. Francisco Martinez Trinidad, and J. Kittler, "A review of instance selection methods," Artif. Intell. Rev Vol. 34, No. 2, pp. 133-143, Aug. 2010. crossref(new window)

S. Garcia, J. Derrac, J. Cano, and F. Herrera, "Prototype Selection for Nearest Neighbor Classification : Taxonomy and Empirical Study," IEEE Transactions on Pattern Analysis and Machone Intelligence, Vol. 34, No. 3, pp. 417-435, Mar. 2012. crossref(new window)

D. S. Hwang and D. W. Kim, "Near-boundary data selection for fast support vector machines," Malasian journal of Computer Science, Vol. 25(l), pp. 23-37, Mar. 2012

F. Angiulli, "FastNearestNeighbor Condensation for Large Data Sets Classification," IEEE Transactions onKnowledge andData Engineering, Vol. 19, No. 11, pp. 1450-1464, Nov. 2007. crossref(new window)

D. R. Wilson, and T. R. Martinez, "Reduction Techniques for Instance-BasedLearning Algorithms," Machine Learning, Vol. 38, No. 3, pp. 257-286, Mar. 2000. crossref(new window)

J. Bien and R. Tibshirani, "Prototype selection for interpretable classification," The Annuals of Applied Statistics Vol. 5, No. 4, pp. 2403-2424, Dec, 2011. crossref(new window)

I. Takigawa, M. Kudo, and A. Nakamura, "Convex sets as prototypes for classifying patterns," Engineering Applications of Artificial Intelligence, Vol. 22, No. 1, pp.101-108, Feb. 2009. crossref(new window)

D. Marchette, "Class cover catch digraphs," Wiley Interdisciplinary Reviews : Computational Statistics Vol. 2, No. 2, pp. 171-177, Mar. 2010.

R. Younsi, and A. Bagnall, "An efficient randomised sphere cover classifier," Int. J. of Data Mining, Modelling and Management, Vol. 4, No. 2, pp.156-171, Jan. 2012. crossref(new window)

GLPK, The GLPK Linear Programming Kit Package,

Vijay V. Vazirani, "Approximation Algorithms," Springer, 2001.

UCI Machine Learning Repository,

The DELVE Manual,

Stalog project,

K. S. Kim and D. S. Hwang "Support Vector Machine Algorithm for Imbalanced Data Learning," Journal of the Korea Society of Computer and Information, Vol. 15, No. 7, pp. 11-17, July. 2010 crossref(new window)