title: Selecting critical patterns based on local geometrical and statistical information.
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.
authors.affiliation: School of Computing and Intelligent Systems, University of Ulster, Londonderry BT487JL, UK. y.li@ulster.ac.uk
authors.forename: Yuhua
authors.initials: Y
authors.lastname: Li
authors.forename: Liam
authors.initials: L
authors.lastname: Maguire
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated / Q000379:methods*; D011336:Probability