100,95 €
UVP 117,69 €
Versandkostenfrei per Post / DHL
Lieferzeit 2-4 Werktage
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.
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.
Sebastian Bruch works at Pinecone in the United States as a research scientist. His research is centered around probabilistic data structures and approximate algorithms for retrieval, and efficient inference algorithms for learnt ranking functions. He is presently serving as an Associate Editor with the ACM TOIS journal.
Preface.- Part I Introduction.- Part II Retrieval Algorithms.- Part III Compression.- Part IV Appendices.
| Erscheinungsjahr: | 2024 |
|---|---|
| Genre: | Informatik, Mathematik, Medizin, Naturwissenschaften, Technik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Taschenbuch |
| Inhalt: |
xx
185 S. |
| ISBN-13: | 9783031551819 |
| ISBN-10: | 3031551818 |
| Sprache: | Englisch |
| Einband: | Kartoniert / Broschiert |
| Autor: | Bruch, Sebastian |
| Hersteller: |
Springer Nature Switzerland
Springer International Publishing AG |
| Verantwortliche Person für die EU: | Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com |
| Maße: | 235 x 155 x 12 mm |
| Von/Mit: | Sebastian Bruch |
| Erscheinungsdatum: | 28.03.2024 |
| Gewicht: | 0,324 kg |
Ähnliche Produkte
Lieferzeit 2-4 Werktage
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 2-4 Werktage
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen