FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

Explaining the Success of Nearest Neighbor Methods in Prediction

George H. Chen
    Product form
      FORMAT: Paperback / softback
      YOU COULD EARN 0 FUTURE RETAIL DISCOUNTS.

      This product is either out of print or out of stock. Add it to your wishlist and we will automatically let you know if it comes back into stock. Add to Wishlist

      ESTIMATED DELIVERY: Possibly out of print
      BUY NOW PAY LATER
      From R 0.00 per month!
      3x monthly payments of R 0.00 with
      4x fortnightly payments of R 0.00 with

      This product is either out of print or out of stock. Add it to your wishlist and we will automatically let you know if it comes back into stock. Add to Wishlist

      Many modern methods for prediction leverage nearest neighbour 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-neighbour-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.
      Format: Paperback / softback CONTRIBUTORS: George H. Chen EAN: 9781680834543 COUNTRY: United States PAGES: WEIGHT: 376 g HEIGHT: 234 cm
      PUBLISHED BY: now publishers Inc DATE PUBLISHED: 2018-05-31 CITY: GENRE: COMPUTERS / Machine Theory WIDTH: 156 cm SPINE:

      Book Themes:

      Mathematical theory of computation, Machine learning

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Many modern methods for prediction leverage nearest neighbour 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-neighbour-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.
      Format: Paperback / softback CONTRIBUTORS: George H. Chen EAN: 9781680834543 COUNTRY: United States PAGES: WEIGHT: 376 g HEIGHT: 234 cm
      PUBLISHED BY: now publishers Inc DATE PUBLISHED: 2018-05-31 CITY: GENRE: COMPUTERS / Machine Theory WIDTH: 156 cm SPINE:

      Book Themes:

      Mathematical theory of computation, Machine learning

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account