Reduction Techniques for Instance-BasedLearning Algorithms
Machine Learning
Advances in Instance Selection for Instance-Based Learning Algorithms
Data Mining and Knowledge Discovery
Fast minimization of structural risk by nearest neighbor rule
IEEE Transactions on Neural Networks
Distributed Nearest Neighbor-Based Condensation of Very Large Data Sets
IEEE Transactions on Knowledge and Data Engineering
Fast Nearest Neighbor Condensation for Large Data Sets Classification
IEEE Transactions on Knowledge and Data Engineering
Condensed Nearest Neighbor Data Domain Description
IEEE Transactions on Pattern Analysis and Machine Intelligence
A grid-based architecture for nearest neighbor based condensation of huge datasets
UPGRADE '08 Proceedings of the third international workshop on Use of P2P, grid and agents for the development of content networks
Graph-Based Discrete Differential Geometry for Critical Instance Filtering
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
Protein data condensation for effective quaternary structure classification
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
Semisupervised condensed nearest neighbor for part-of-speech tagging
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Pattern Recognition Letters
A simple noise-tolerant abstraction algorithm for fast k-NN classification
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part II
Efficient distributed data condensation for nearest neighbor classification
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A hybrid KNN-ant colony optimization algorithm for prototype selection
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
Cache based approach for improving location based query processing in mobile environment
Proceedings of the First International Conference on Security of Internet of Things
IDS false alarm reduction using an instance selection KNN-memetic algorithm
International Journal of Metaheuristics
A comparison between k-Optimum Path Forest and k-Nearest Neighbors supervised classifiers
Pattern Recognition Letters
Identifying predictive hubs to condense the training set of $$k$$-nearest neighbour classifiers
Computational Statistics
| Hi-index | 0.00 |
We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties. Indeed, it is order independent, and has subquadratic worst case time complexity, while it requires few iterations to converge, and it is likely to select points very close to the decision boundary. We compare the FCNN rule with state of the art competence preservation algorithms on large multidimensional training sets, showing that it outperforms existing methods in terms of learning speed and learning scaling behavior, and in terms of size of the model, while it guarantees a comparable prediction accuracy.