Selecting Critical Patterns Based on Local Geometrical and Statistical Information
- 28 October 2010
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 33 (6) , 1189-1201
Abstract
Pattern selection methods have been traditionally developed with a dependency on a specific classifier. In contrast, this paper presents a method that selects critical patterns deemed to carry essential information applicable to train those types of classifiers which require spatial information of the training data set. Critical patterns include those edge patterns that define the boundary and those border patterns that separate classes. The proposed method selects patterns from a new perspective, primarily based on their location in input space. It determines class edge patterns with the assistance of the approximated tangent hyperplane of a class surface. It also identifies border patterns between classes using local probability. The proposed method is evaluated on benchmark problems using popular classifiers, including multilayer perceptrons, radial basis functions, support vector machines, and nearest neighbors. The proposed approach is also compared with four state-of-the-art approaches and it is shown to provide similar but more consistent accuracy from a reduced data set. Experimental results demonstrate that it selects patterns sufficient to represent class boundary and to preserve the decision surface.Keywords
This publication has 60 references indexed in Scilit:
- Using locally estimated geodesic distance to optimize neighborhood graph for isometric data embeddingPattern Recognition, 2008
- Experimental study on prototype optimisation algorithms for prototype-based classification in vector spacesPattern Recognition, 2006
- Prototype selection for dissimilarity-based classifiersPattern Recognition, 2006
- Learning prototypes and distances: A prototype reduction technique based on nearest neighbor error minimizationPattern Recognition, 2006
- High training set size reduction by space partitioning and prototype abstractionPattern Recognition, 2004
- Efficient leave-one-out cross-validation of kernel fisher discriminant classifiersPattern Recognition, 2003
- Enhancing prototype reduction schemes with LVQ3-type algorithmsPattern Recognition, 2003
- Optimal reference subset selection for nearest neighbor classification by tabu searchPattern Recognition, 2002
- A fast nearest neighbor search algorithm by filtrationPattern Recognition, 2002
- The significance of border training patterns in classification by a feedforward neural network using back propagation learningInternational Journal of Remote Sensing, 1999