Coresets for the Nearest-Neighbor Rule
From MaRDI portal
Publication:5874517
DOI10.4230/LIPIcs.ESA.2020.47OpenAlexW3082554986MaRDI QIDQ5874517
Alejandro Flores-Velazco, David M. Mount
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2002.06650
classificationapproximation algorithmscoresetsnearest-neighbor ruleapproximate nearest-neighbornearest-neighbor condensationtraining-set reduction
Related Items (1)
Cites Work
- Unnamed Item
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Non deterministic polynomial optimization problems and their approximations
- Chromatic nearest neighbor searching: A query sensitive approach
- Searching dynamic point sets in spaces with bounded doubling dimension
- A threshold of ln n for approximating set cover
- Core-Sets: Updated Survey
- Space-time tradeoffs for approximate nearest neighbor searching
- On coresets for k-means and k-median clustering
- A Greedy Heuristic for the Set-Covering Problem
- On the Inequality of Cover and Hart in Nearest Neighbor Discrimination
- Decomposable searching problems I. Static-to-dynamic transformation
- An algorithm for a selective nearest neighbor decision rule (Corresp.)
- On the hardness of approximating minimization problems
- Approximate Polytope Membership Queries
- A unified framework for approximating and clustering data
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- Nearest neighbor pattern classification
This page was built for publication: Coresets for the Nearest-Neighbor Rule
