Predicting noise filtering efficacy with data complexity measures for nearest neighbor classification
Top Cited Papers
- 31 January 2013
- journal article
- Published by Elsevier BV in Pattern Recognition
- Vol. 46 (1), 355-364
- https://doi.org/10.1016/j.patcog.2012.07.009
Abstract
No abstract availableKeywords
Funding Information
- Ministério da Educação e Ciência
- Ministerio de Ciencia y Tecnología (P10-TIC-6858, TIN2010-15055, TIN2011-28488)
This publication has 40 references indexed in Scilit:
- Differential evolution for optimizing the positioning of prototypes in nearest neighbor classificationPattern Recognition, 2011
- Nearest neighbour group-based classificationPattern Recognition, 2010
- Fast exact k nearest neighbors search using an orthogonal search treePattern Recognition, 2010
- Probably correct k-nearest neighbor search in high dimensionsPattern Recognition, 2010
- Machine learning and data mining: introduction to principles and algorithmsChoice Reviews Online, 2008
- Classification in the presence of class noise using a probabilistic Kernel Fisher methodPattern Recognition, 2007
- An SVM classifier incorporating simultaneous noise reduction and feature selection: illustrative case examplesPattern Recognition, 2005
- Feature subset selection using a new definition of classifiabilityPattern Recognition Letters, 2003
- Improved k-nearest neighbor classificationPattern Recognition, 2002
- Pattern recognition in the presence of noisePattern Recognition, 1995