NEAREST NEIGHBOR PROBLEMS

DOI10.1142/S0218195992000226zbMATH Open0776.68102OpenAlexW2115342786MaRDI QIDQ3136223FDOQ3136223

Gordon Wilfong

Publication date: 26 November 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195992000226

Recommendations

• Algorithms and hardness results for nearest neighbor problems in bicolored point sets
• Guarantees on nearest-neighbor condensation heuristics
• scientific article; zbMATH DE number 2101282
• scientific article
• On the selection of the globally optimal prototype subset for nearest-neighbor classification

zbMATH Keywords

NP-completepolynomial time algorithmminimum size consistent subsetoptimal disc cover problem

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Analysis of algorithms and problem complexity (68Q25)

Cited In (8)

• Supervised classification and mathematical optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rough-fuzzy weighted \(k\)-nearest leader classifier for large data sets
• Nearest neighbor representations of Boolean functions
• Optimization problems in extension matrices
• On the minimum consistent subset problem
• Advances in Intelligent Data Analysis VI

This page was built for publication: NEAREST NEIGHBOR PROBLEMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136223)