Achieving the time of $1$-NN, but the accuracy of $k$-NN

v1v2 (latest)

Achieving the time of $1$ -NN, but the accuracy of $k$ -NN

6 December 2017

ArXiv (abs)PDF HTML

Papers citing "Achieving the time of $1$-NN, but the accuracy of $k$-NN"

7 / 7 papers shown

Title
On Rate-Optimal Partitioning Classification from Observable and from Privatised Data Balázs Csanád Csáji László Gyorfi Ambrus Tamás Harro Walk 112 0 0 22 Dec 2023
Weighted Distance Nearest Neighbor Condensing Lee-Ad Gottlieb Timor Sharabi Roi Weiss 52 0 0 24 Oct 2023
On Error and Compression Rates for Prototype Rules Omer Kerem Roi Weiss 55 1 0 16 Jun 2022
Benefit of Interpolation in Nearest Neighbor Algorithms Yue Xing Qifan Song Guang Cheng 91 30 0 23 Feb 2022
Under-bagging Nearest Neighbors for Imbalanced Classification H. Hang Yuchao Cai Hanfang Yang Zhouchen Lin 134 12 0 01 Sep 2021
Universal consistency and rates of convergence of multiclass prototype algorithms in metric spaces László Gyorfi Roi Weiss 102 20 0 01 Oct 2020
Fast and Bayes-consistent nearest neighbors K. Efremenko A. Kontorovich Moshe Noivirt 47 3 0 07 Oct 2019