Coresets for the Nearest-Neighbor Rule

DOI10.4230/LIPICS.ESA.2020.47MaRDI QIDQ5874517zbMATH OpenOpenAlexFDO

Authors Alejandro Flores-Velazco, David M. Mount

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/2002.06650

zbMATH Keywords

classificationapproximation algorithmscoresetsnearest-neighbor ruleapproximate nearest-neighbornearest-neighbor condensationtraining-set reduction

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 5019895 (Why is no real title available?)
• A Greedy Heuristic for the Set-Covering Problem
• A threshold of ln n for approximating set cover
• A unified framework for approximating and clustering data
• An algorithm for a selective nearest neighbor decision rule (Corresp.)
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• Approximate polytope membership queries
• Chromatic nearest neighbor searching: A query sensitive approach
• Core-sets: updated survey
• Decomposable searching problems I. Static-to-dynamic transformation
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Nearest neighbor pattern classification
• Non deterministic polynomial optimization problems and their approximations
• On coresets for k-means and k-median clustering
• On the Inequality of Cover and Hart in Nearest Neighbor Discrimination
• On the hardness of approximating minimization problems
• Searching dynamic point sets in spaces with bounded doubling dimension
• Space-time tradeoffs for approximate nearest neighbor searching

Cited in

(2)

• Guarantees on nearest-neighbor condensation heuristics
• Coresets for Discrete Integration and Clustering

This page was built for publication: Coresets for the Nearest-Neighbor Rule

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