Near-Optimal Sample Compression for Nearest Neighbors

DOI10.1109/TIT.2018.2822267zbMath1395.94224arXiv1404.3368OpenAlexW2964031538MaRDI QIDQ5375566

Pinhas Nisnevitch, Leonid (Aryeh) Kontorovich, Lee-Ad J. Gottlieb

Publication date: 14 September 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Related Items (6)

Nearest neighbor representations of Boolean functions ⋮ The inverse Voronoi problem in graphs. I: Hardness ⋮ On the minimum consistent subset problem ⋮ Universal Bayes consistency in metric spaces ⋮ Non-uniform packings ⋮ Robust randomized optimization with k nearest neighbors

This page was built for publication: Near-Optimal Sample Compression for Nearest Neighbors