Normal view MARC view ISBD view

Nearest-neighbor methods in learning and vision : theory and practice / [edited by] Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk.

Contributor(s): Darrell, Trevor | Shakhnarovich, Gregory | Indyk, Piotr | IEEE Xplore (Online Service) [distributor.] | MIT Press [publisher.].
Material type: materialTypeLabelBookSeries: Neural information processing series: Publisher: Cambridge, Massachusetts : MIT Press, c2005Distributor: [Piscataqay, New Jersey] : IEEE Xplore, [2006]Description: 1 PDF (vi, 252 pages) : illustrations.Content type: text Media type: electronic Carrier type: online resourceISBN: 9780262256957.Subject(s): Nearest neighbor analysis (Statistics) -- Congresses | Machine learning -- Congresses | Algorithms -- Congresses | Geometry -- Data processing -- Congresses | Nearest neighbor analysis (Statistics) | Machine learning | Geometry -- Data processing | Algorithms | Artificial IntelligenceGenre/Form: Electronic books.DDC classification: 006.3/1 Online resources: Abstract with links to resource Also available in print.Summary: 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 naive methods for NN search prohibitively expensive. The final chapters describe successful applications of an NN algorithm, locality-sensitive hashing (LSH), to vision tasks.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Includes bibliographical references and index.

Restricted to subscribers or individual electronic text purchasers.

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 naive methods for NN search prohibitively expensive. The final chapters describe successful applications of an NN algorithm, locality-sensitive hashing (LSH), to vision tasks.

Also available in print.

Mode of access: World Wide Web

Title from title screen.

Description based on PDF viewed 12/23/2015.

There are no comments for this item.

Log in to your account to post a comment.

International Institute of Information Technology, Bangalore
26/C, Electronics City, Hosur Road,Bengaluru-560100 Contact Us
Koha & OPAC at IIITB deployed by Bhargav Sridhar & Team.

Powered by Koha