Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal reference subset selection for nearest neighbor classification by tabu search

From MaRDI portal
Publication:1601565
Jump to:navigation, search

DOI10.1016/S0031-3203(01)00137-6zbMath1016.68089OpenAlexW2124537254MaRDI QIDQ1601565

Guangyu Sun, Hong Bin 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


zbMATH Keywords

tabu searchoptimal reference subset


Mathematics Subject Classification ID

Searching and sorting (68P10) Pattern recognition, speech recognition (68T10)


Related Items

Parallel sampling from big data with uncertainty distribution ⋮ GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Self-generating prototypes for pattern classification


Uses Software

  • Tabu search


Cites Work

  • Bias of Nearest Neighbor Error Estimates
  • Bayes Error Estimation Using Parzen and k-NN Procedures
  • Finding Prototypes For Nearest Neighbor Classifiers
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1601565&oldid=13901580"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 03:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki