Optimal reference subset selection for nearest neighbor classification by tabu search

Pattern Recognition

Volumn 35, Issue 7, 2002, Pages 1481-1490

  Zhang, Hongbin ^a   Sun, Guangyu ^a  

^a BEIJING UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Nearest neighbor classification; Prototype selection; Reference set; Tabu search

Indexed keywords

ALGORITHMS; SET THEORY;

NEIGHBOR CLASSIFICATION;

PATTERN RECOGNITION;

ALGORITHM; ERROR ANALYSIS; NEAREST NEIGHBOR ANALYSIS; PATTERN RECOGNITION;

EID: 0036643301     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(01)00137-6     Document Type: Article

References (17)

1. The condensed nearest neighbor rule
2. The reduced nearest neighbor rule
3. Sample set condensation for a condensed nearest neighbor decision rule for pattern recognition
4. Finding prototypes for nearest neighbor classifiers
5. On the edited nearest neighbor rule
6. Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems design
7. Fitness functions in editing k-NN reference set by genetic algorithms
8. Nearest prototype classification: Clustering, genetic algorithms, or random search
9. Parallel random search and Tabu search for the minimal consistent subset selection problem
10. Tabu search
11. A bootstrap technique for nearest neighbor classifier design
12. On the dominance of non-parametric Bayes rule discriminant algorithms in high dimensions
13. Bias on nearest neighbor error estimates
14. Bayes error estimation using Parzen and k-NN procedures