Coresets for the Nearest-Neighbor Rule

DOI10.4230/LIPICS.ESA.2020.47OpenAlexW3082554986MaRDI QIDQ5874517FDOQ5874517

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

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

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)