A new kind of science
Hybrid particle swarm optimization algorithm with fine tuning operators
International Journal of Bio-Inspired Computation
Artificial physics optimisation: a brief survey
International Journal of Bio-Inspired Computation
New inspirations in swarm intelligence: a survey
International Journal of Bio-Inspired Computation
Nearest prototype classification: clustering, genetic algorithms, or random search?
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Nearest neighbor pattern classification
IEEE Transactions on Information Theory
The condensed nearest neighbor rule (Corresp.)
IEEE Transactions on Information Theory
Fast minimization of structural risk by nearest neighbor rule
IEEE Transactions on Neural Networks
Local Feature Weighting in Nearest Prototype Classification
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Most of the prototype reduction algorithms process the data in its entirety to yield a consistent subset, which is very useful in nearest neighbour classification. Their main disadvantage is the excessive computational cost when the prototype size is very large. In this paper, we present a cellular automata (CA)-based nearest neighbour rule condensation method to reduce useless points in a given training set. This method retains only the points on the boundary between different classes, and the amount of the reduced rules of the reference set can be revised by the granularity of the CA lattice. The main advantages of the proposed method are, on the one hand, that it is able to condense a given rule set within less time compared to other traditional algorithms. On the other hand, with the proposed algorithm, we can get a consistent subset of the given set in the divide-reduce-coalesce manner. Experiments show successful results when the size of the given dataset is large.