- We will send in 10–14 business days.
/images/books/11784873/9781680834543.jpg)
- Author: George H Chen
- Publisher: Now Publishers
- ISBN-10: 1680834541
- ISBN-13: 9781680834543
- Format: 15.6 x 23.4 x 1.4 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Explaining the Success of Nearest Neighbor Methods in Prediction (e-book) (used book) | bookbook.eu
Reviews
Description
Many modern methods for prediction leverage nearest neighbor search to find past training examples most similar to a test example, an idea that dates back in text to at least the 11th century and has stood the test of time. This monograph explains the success of these methods, both in theory, covering foundational nonasymptotic statistical guarantees on nearest-neighbor-based regression and classification, and in practice, gathering prominent methods for approximate nearest neighbor search that have been essential to scaling prediction systems reliant on nearest neighbor analysis to handle massive datasets. Furthermore, it looks at connections to learning distances for use with nearest neighbor methods, including how random decision trees and ensemble methods learn nearest neighbor structure, as well as recent developments in crowdsourcing and graphons.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.10:34:44
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: George H Chen
- Publisher: Now Publishers
- ISBN-10: 1680834541
- ISBN-13: 9781680834543
- Format: 15.6 x 23.4 x 1.4 cm, minkšti viršeliai
- Language: English English
Many modern methods for prediction leverage nearest neighbor search to find past training examples most similar to a test example, an idea that dates back in text to at least the 11th century and has stood the test of time. This monograph explains the success of these methods, both in theory, covering foundational nonasymptotic statistical guarantees on nearest-neighbor-based regression and classification, and in practice, gathering prominent methods for approximate nearest neighbor search that have been essential to scaling prediction systems reliant on nearest neighbor analysis to handle massive datasets. Furthermore, it looks at connections to learning distances for use with nearest neighbor methods, including how random decision trees and ensemble methods learn nearest neighbor structure, as well as recent developments in crowdsourcing and graphons.
Reviews