Indyk and Naor introduced embeddings that preserve this algorithm’s output for sets with a low doubling constant or low aspect ratio. A “condensed” version of this algorithm that uses prototypes to reduce the size of the dataset was developed by Peter Hart. (r1, r2, p1, p2)-sensitive families of functions were originally introduced to perform this algorithm using locality-sensitive hashing. (15[1])Cover and Hart showed that the simplest version of this (15[1])algorithm has error bounded by (15[1])two times the Bayes (-5[1])error rate. Usage of a (*) k-d tree allows single queries in this algorithm to be computed in O(log (-5[1])n) time. When used for classification, (-5[1])this algorithm’s namesake parameter is often (-5[1])chosen to be odd to avoid ties. (-5[1])For 10 points, (10[1])distance-based (10[1])or simple majority voting (10[1])can be used in what classification (10[1])algorithm that examines (10[1])close samples to an input? (10[1])■END■ (10[8]0[10])