On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification
From MaRDI portal
Publication:2892360
DOI10.1287/ijoc.1060.0183zbMath1241.90086OpenAlexW2022703206MaRDI QIDQ2892360
Frank Plastria, Dolores Romero Morales, Belén Martín-Barragán, Emilio Carrizosa
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:ed890122-5dfc-4cda-b783-b1350b909dc9
Integer programming (90C10) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Multi-instance classification through spherical separation and VNS ⋮ Supervised classification and mathematical optimization ⋮ On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ Optimization approaches to supervised classification ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications
This page was built for publication: On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification
