A sample set condensation algorithm for the class sensitive artificial neural network
Pattern Recognition Letters
Instance Selection and Construction for Data Mining
Instance Selection and Construction for Data Mining
Discovering Useful Concept Prototypes for Classification Based on Filtering and Abstraction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Finding Prototypes For Nearest Neighbor Classifiers
IEEE Transactions on Computers
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Pattern Recognition
AMPSO: a new particle swarm method for nearest neighborhood classification
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Introduction to Machine Learning
Introduction to Machine Learning
Information Sciences: an International Journal
IEEE Transactions on Knowledge and Data Engineering
IPADE: iterative prototype adjustment for nearest neighbor classification
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Nearest neighbor is one of the most used techniques for performing classification tasks. However, its simplest version has several drawbacks, such as low efficiency, storage requirements and sensitivity to noise. Prototype generation is an appropriate process to alleviate these drawbacks that allows the fitting of a data set for nearest neighbor classification. In this work, we present an extension of our previous proposal called IPADE, a methodology to learn iteratively the positioning of prototypes using a differential evolution algorithm. In this extension, which we have called IPADECS, a complete solution is codified in each individual. The results are contrasted with non-parametrical statistical tests and show that our proposal outperforms previously proposed methods.