Optimal reference subset selection for nearest neighbor classification by tabu search
From MaRDI portal
Publication:1601565
DOI10.1016/S0031-3203(01)00137-6zbMATH Open1016.68089OpenAlexW2124537254MaRDI QIDQ1601565FDOQ1601565
Authors: Guangyu Sun, Hongbin Zhang 
Publication date: 27 June 2002
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0031-3203(01)00137-6
Recommendations
- Optimal selection of reference set for the nearest neighbor classification by tabu search
- Feature selection using tabu search method
- On the selection of the globally optimal prototype subset for nearest-neighbor classification
- Design of nearest neighbor classifiers: Multi-objective approach
- Feature Selection for Heterogeneous Ensembles of Nearest-neighbour Classifiers Using Hybrid Tabu Search
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding Prototypes For Nearest Neighbor Classifiers
- Bias of Nearest Neighbor Error Estimates
- Bayes Error Estimation Using Parzen and k-NN Procedures
Cited In (6)
- Parallel sampling from big data with uncertainty distribution
- Feature Selection for Heterogeneous Ensembles of Nearest-neighbour Classifiers Using Hybrid Tabu Search
- Self-generating prototypes for pattern classification
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
- Optimal selection of reference set for the nearest neighbor classification by tabu search
- Advances in Intelligent Data Analysis VI
Uses Software
This page was built for publication: Optimal reference subset selection for nearest neighbor classification by tabu search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601565)
