Local nearest neighbour classification with applications to semi-supervised learning (Q2196247)

As known very well, in the year of 1951, in the article of \textit{E. Fix} and \textit{J. L. Hodges}, [``Discriminatory analysis -- nonparametric discrimination: consistency properties'', Technical Report to USAF School of Medicine (Randolph Field, TX), see also Zbl 0715.62080], a simple nonparametric classifier, the \(k\)-nearest neighbour classifier, has been defined. The present article starts with the review of some contributions in the domain of supervised classification problems. In the second section, the local-\(k\)-nearest neighbour classifier which allows the number of neighbours to vary depending on the location of the test point is defined. In the third section, under some special assumptions, an asymptotic expansion for the global excess risk of the standard \(k\)-nearest neighbour classifier is presented. A discussion on different choices of \(k\) covers the fourth section. In the fifth section, the minimax lower bound is presented. The sixth section is devoted to all proofs. The authors report that additional theoretical results and a simulation study are contained in a supplementary material: ``Local nearest neighbour classification with applications to semi-supervised learning'' [\textit{T. I. Cannings} et al., Ann. Stat. 48, No. 3, 1789--1814 (2020; Zbl 07241612)].