| 000 | 03106nam a22005175i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-55182-6 | ||
| 003 | DE-He213 | ||
| 005 | 20240730171705.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 240327s2024 sz | s |||| 0|eng d | ||
| 020 |
_a9783031551826 _9978-3-031-55182-6 |
||
| 024 | 7 |
_a10.1007/978-3-031-55182-6 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUNH _2bicssc |
|
| 072 | 7 |
_aUND _2bicssc |
|
| 072 | 7 |
_aCOM030000 _2bisacsh |
|
| 072 | 7 |
_aUNH _2thema |
|
| 072 | 7 |
_aUND _2thema |
|
| 082 | 0 | 4 |
_a025.04 _223 |
| 100 | 1 |
_aBruch, Sebastian. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _999952 |
|
| 245 | 1 | 0 |
_aFoundations of Vector Retrieval _h[electronic resource] / _cby Sebastian Bruch. |
| 250 | _a1st ed. 2024. | ||
| 264 | 1 |
_aCham : _bSpringer Nature Switzerland : _bImprint: Springer, _c2024. |
|
| 300 |
_aXX, 185 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 505 | 0 | _aPreface -- Part I Introduction -- Part II Retrieval Algorithms -- Part III Compression -- Part IV Appendices. . | |
| 520 | _aThis book presents the fundamentals of vector retrieval. To this end, it delves into important data structures and algorithms that have been successfully used to solve the vector retrieval problem efficiently and effectively. This monograph is divided into four parts. The first part introduces the problem of vector retrieval and formalizes the concepts involved. The second part delves into retrieval algorithms that help solve the vector retrieval problem efficiently and effectively. It includes a chapter each on brand-and-bound algorithms, locality sensitive hashing, graph algorithms, clustering, and sampling. Part three is devoted to vector compression and comprises chapters on quantization and sketching. Finally, the fourth part presents a review of background material in a series of appendices, summarizing relevant concepts from probability, concentration inequalities, and linear algebra. The book emphasizes the theoretical aspects of algorithms and presents related theorems and proofs. It is thus mainly written for researchers and graduate students in theoretical computer science and database and information systems who want to learn about the theoretical foundations of vector retrieval. | ||
| 650 | 0 |
_aInformation storage and retrieval systems. _922213 |
|
| 650 | 0 |
_aComputer science _xMathematics. _93866 |
|
| 650 | 1 | 4 |
_aInformation Storage and Retrieval. _923927 |
| 650 | 2 | 4 |
_aMathematics of Computing. _931875 |
| 650 | 2 | 4 |
_aMathematical Applications in Computer Science. _931683 |
| 710 | 2 |
_aSpringerLink (Online service) _999953 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031551819 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031551833 |
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-55182-6 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 942 | _cEBK | ||
| 999 |
_c87751 _d87751 |
||