Nearest-neighbor methods in learning and vision: theory and practice
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 m...
Gespeichert in:
| Weitere beteiligte Personen: | , , |
|---|---|
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, Mass.
MIT Press
©2005
|
| Schriftenreihe: | Neural information processing series
|
| Links: | https://doi.org/10.7551/mitpress/4908.001.0001?locatt=mode:legacy |
| Zusammenfassung: | 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. |
| Beschreibung: | " ... held in Whistler, British Columbia ... annual conference on Neural Information Processing Systems (NIPS) in December 2003"--Preface. |
| Umfang: | 1 Online-Ressource (vi, 252 Seiten) Illustrationen |
| ISBN: | 0262256959 9780262256957 |
Internformat
MARC
| LEADER | 00000cam a22000004a 4500 | ||
|---|---|---|---|
| 001 | ZDB-260-MPOB-4908 | ||
| 003 | MaCbMITP | ||
| 005 | 20190503073334.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 060516s2005 maua obs 101 0 eng d | ||
| 020 | |a 0262256959 | ||
| 020 | |a 9780262256957 | ||
| 245 | 0 | 0 | |a Nearest-neighbor methods in learning and vision |b theory and practice |c edited by Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk |
| 264 | 1 | |a Cambridge, Mass. |b MIT Press |c ©2005 | |
| 300 | |a 1 Online-Ressource (vi, 252 Seiten) |b Illustrationen | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Neural information processing series | |
| 500 | |a " ... held in Whistler, British Columbia ... annual conference on Neural Information Processing Systems (NIPS) in December 2003"--Preface. | ||
| 520 | |a 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. | ||
| 700 | 1 | |a Darrell, Trevor | |
| 700 | 1 | |a Indyk, Piotr | |
| 700 | 1 | |a Shakhnarovich, Gregory | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 026219547X |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780262195478 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-260-MPOB |q TUM_PDA_MPOB |3 MIT Press |u https://doi.org/10.7551/mitpress/4908.001.0001?locatt=mode:legacy |3 Volltext |
| 912 | |a ZDB-260-MPOB | ||
| 912 | |a ZDB-260-MPOB | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-260-MPOB-4908 |
|---|---|
| _version_ | 1821493839967289344 |
| adam_text | |
| any_adam_object | |
| author2 | Darrell, Trevor Indyk, Piotr Shakhnarovich, Gregory |
| author2_role | |
| author2_variant | t d td p i pi g s gs |
| author_facet | Darrell, Trevor Indyk, Piotr Shakhnarovich, Gregory |
| author_sort | Darrell, Trevor |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-260-MPOB |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02622cam a22003134a 4500</leader><controlfield tag="001">ZDB-260-MPOB-4908</controlfield><controlfield tag="003">MaCbMITP</controlfield><controlfield tag="005">20190503073334.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">060516s2005 maua obs 101 0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262256959</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262256957</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Nearest-neighbor methods in learning and vision</subfield><subfield code="b">theory and practice</subfield><subfield code="c">edited by Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">MIT Press</subfield><subfield code="c">©2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (vi, 252 Seiten)</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Neural information processing series</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">" ... held in Whistler, British Columbia ... annual conference on Neural Information Processing Systems (NIPS) in December 2003"--Preface.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Darrell, Trevor</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Indyk, Piotr</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shakhnarovich, Gregory</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">026219547X</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780262195478</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-260-MPOB</subfield><subfield code="q">TUM_PDA_MPOB</subfield><subfield code="3">MIT Press</subfield><subfield code="u">https://doi.org/10.7551/mitpress/4908.001.0001?locatt=mode:legacy</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-260-MPOB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-260-MPOB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-260-MPOB-4908 |
| illustrated | Illustrated |
| indexdate | 2025-01-17T11:04:52Z |
| institution | BVB |
| isbn | 0262256959 9780262256957 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (vi, 252 Seiten) Illustrationen |
| psigel | ZDB-260-MPOB TUM_PDA_MPOB ZDB-260-MPOB |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | MIT Press |
| record_format | marc |
| series2 | Neural information processing series |
| spelling | Nearest-neighbor methods in learning and vision theory and practice edited by Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk Cambridge, Mass. MIT Press ©2005 1 Online-Ressource (vi, 252 Seiten) Illustrationen txt c cr Neural information processing series " ... held in Whistler, British Columbia ... annual conference on Neural Information Processing Systems (NIPS) in December 2003"--Preface. 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. Darrell, Trevor Indyk, Piotr Shakhnarovich, Gregory Erscheint auch als Druck-Ausgabe 026219547X Erscheint auch als Druck-Ausgabe 9780262195478 |
| spellingShingle | Nearest-neighbor methods in learning and vision theory and practice |
| title | Nearest-neighbor methods in learning and vision theory and practice |
| title_auth | Nearest-neighbor methods in learning and vision theory and practice |
| title_exact_search | Nearest-neighbor methods in learning and vision theory and practice |
| title_full | Nearest-neighbor methods in learning and vision theory and practice edited by Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk |
| title_fullStr | Nearest-neighbor methods in learning and vision theory and practice edited by Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk |
| title_full_unstemmed | Nearest-neighbor methods in learning and vision theory and practice edited by Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk |
| title_short | Nearest-neighbor methods in learning and vision |
| title_sort | nearest neighbor methods in learning and vision theory and practice |
| title_sub | theory and practice |
| work_keys_str_mv | AT darrelltrevor nearestneighbormethodsinlearningandvisiontheoryandpractice AT indykpiotr nearestneighbormethodsinlearningandvisiontheoryandpractice AT shakhnarovichgregory nearestneighbormethodsinlearningandvisiontheoryandpractice |