Foundations of Vector Retrieval
Autor Sebastian Bruchen Limba Engleză Paperback – 28 mar 2024
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.
Preț: 686.31 lei
Preț vechi: 857.89 lei
-20% Nou
Puncte Express: 1029
Preț estimativ în valută:
131.39€ • 135.12$ • 108.100£
131.39€ • 135.12$ • 108.100£
Carte tipărită la comandă
Livrare economică 20 februarie-06 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031551819
ISBN-10: 3031551818
Ilustrații: XX, 185 p.
Dimensiuni: 155 x 235 mm
Greutate: 0.3 kg
Ediția:2024
Editura: Springer Nature Switzerland
Colecția Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3031551818
Ilustrații: XX, 185 p.
Dimensiuni: 155 x 235 mm
Greutate: 0.3 kg
Ediția:2024
Editura: Springer Nature Switzerland
Colecția Springer
Locul publicării:Cham, Switzerland
Cuprins
Preface.- Part I Introduction.- Part II Retrieval Algorithms.- Part III Compression.- Part IV Appendices.
Notă biografică
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.
Textul de pe ultima copertă
This 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.
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.
Caracteristici
Presents important data structures and algorithms that solve the vector retrieval problem efficiently and effectively Details branch-and-bound, locality sensitive hashing, graph, clustering and sampling algorithms in separate chapters Emphasizes theoretical aspects and thoroughly explains theorems and proofs