Explaining the Success of Nearest Neighbor Methods in Prediction
From MaRDI portal
Publication:4682659
DOI10.1561/2200000064zbMath1397.68001OpenAlexW4301265533MaRDI QIDQ4682659
Devavrat Shah, George H-G. Chen
Publication date: 18 September 2018
Published in: Foundations and Trends® in Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/2200000064
Inference from stochastic processes and prediction (62M20) Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (3)
Reweighting samples under covariate shift using a Wasserstein distance criterion ⋮ Nearest neighbor forecasting using sparse data representation ⋮ AN ADAPTIVE IMAGE SCALING ALGORITHM BASED ON CONTINUOUS FRACTION INTERPOLATION AND MULTI-RESOLUTION HIERARCHY PROCESSING
This page was built for publication: Explaining the Success of Nearest Neighbor Methods in Prediction