Covers the Nearest Neighbor search algorithm and the Johnson-Lindenstrauss lemma for dimensionality reduction, exploring preprocessing techniques and locality-sensitive hashing.
Explores the nearest neighbor classifier method, discussing its limitations in high-dimensional spaces and the importance of spatial correlation for effective predictions.
Covers the k-Nearest-Neighbor classifier, hand-written digit recognition, multi-class k-NN, data reduction, applications, graph construction, limitations, and the curse of dimensionality.
Explores scalability challenges in shared-work systems, emphasizing optimization and execution, experimental setups, data-query operators, and the impact of schema on learning.