About this Item
Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee. Seller Inventory # 6545-9780262195478
Bibliographic Details
Title: Nearest?Neighbor Methods in Learning and ...
Publisher: MIT Press 00/y /02 M
Publication Date: 2006
Binding: Hardcover
Condition: Very Good
About this title
Advances in computational geometry and machine learning that offer new methods for search, regression, and classification with large amounts of high-dimensional data.
Regression and classification methods based on similarity of the input to stored examples have not been widely used in applications involving very large sets of high-dimensional data. Recent advances in computational geometry and machine learning, however, may alleviate the problems in using these methods on large data sets. This volume presents theoretical and practical discussions of nearest-neighbor (NN) methods in machine learning and examines computer vision as an application domain in which the benefit of these advanced methods is often dramatic. It brings together contributions from researchers in theory of computation, machine learning, and computer vision with the goals of bridging the gaps between disciplines and presenting state-of-the-art methods for emerging applications. The contributors focus on the importance of designing algorithms for NN search, and for the related classification, regression, and retrieval tasks, that remain efficient even as the number of points or the dimensionality of the data grows very large. The book begins with two theoretical chapters on computational geometry and then explores ways to make the NN approach practicable in machine learning applications where the dimensionality of the data and the size of the data sets make the naïve methods for NN search prohibitively expensive. The final chapters describe successful applications of an NN algorithm, locality-sensitive hashing (LSH), to vision tasks.
"About this title" may belong to another edition of this title.
Store Description
We guarantee the condition of every book as it's described
on the Abebooks web sites. If you're dissatisfied with your
purchase (Incorrect Book/Not as Described/Damaged) or if the
order hasn't arrived, you're eligible for a refund within 30
days of the estimated delivery date. If you've changed your
mind about a book that you've ordered, please use the Ask
bookseller a question link to contact us and we'll respond
within 2 business days.
All books will normally be shipped within 1 working day of being ordered. We provide the best shipping rates we can to each country and you can rest assured that if you are not happy with anything you receive, you have a 100% money-back guarantee with us.
Payment Methods
accepted by seller