RHC: a non-parametric cluster-based data reduction for efficient $$k$$ k -NN classification
- 8 August 2014
- journal article
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 19 (1), 93-109
- https://doi.org/10.1007/s10044-014-0393-7
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Fast Nearest Neighbor Condensation for Large Data Sets ClassificationIEEE Transactions on Knowledge and Data Engineering, 2007
- An Efficient Algorithm for Instance-Based Learning on Data StreamsPublished by Springer Nature ,2007
- The Generalized Condensed Nearest Neighbor Rule as A Data Reduction MethodPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Fast condensed nearest neighbor rulePublished by Association for Computing Machinery (ACM) ,2005
- Advances in Instance Selection for Instance-Based Learning AlgorithmsData Mining and Knowledge Discovery, 2002
- A sample set condensation algorithm for the class sensitive artificial neural networkPattern Recognition Letters, 1996
- Tolerating noisy, irrelevant and novel attributes in instance-based learning algorithmsInternational Journal of Man-Machine Studies, 1992
- Instance-Based Learning AlgorithmsMachine Learning, 1991
- Finding Prototypes For Nearest Neighbor ClassifiersIEEE Transactions on Computers, 1974
- Nearest neighbor pattern classificationIEEE Transactions on Information Theory, 1967