Information Retrieval: Algorithms and Heuristics

Portada
Springer Science & Business Media, 21 oct 2004 - 332 páginas

Interested in how an efficient search engine works? Want to know what algorithms are used to rank resulting documents in response to user requests? The authors answer these and other key information retrieval design and implementation questions.

This book is not yet another high level text. Instead, algorithms are thoroughly described, making this book ideally suited for both computer science students and practitioners who work on search-related applications. As stated in the foreword, this book provides a current, broad, and detailed overview of the field and is the only one that does so. Examples are used throughout to illustrate the algorithms.

The authors explain how a query is ranked against a document collection using either a single or a combination of retrieval strategies, and how an assortment of utilities are integrated into the query processing scheme to improve these rankings. Methods for building and compressing text indexes, querying and retrieving documents in multiple languages, and using parallel or distributed processing to expedite the search are likewise described.

This edition is a major expansion of the one published in 1998. Besides updating the entire book with current techniques, it includes new sections on language models, cross-language information retrieval, peer-to-peer processing, XML search, mediators, and duplicate document detection.

 

Índice

VI
1
VII
9
VIII
21
IX
45
X
57
XI
67
XII
70
XIII
74
XXXVII
199
XXXVIII
203
XXXIX
208
XL
209
XLI
211
XLII
215
XLIII
222
XLIV
228

XIV
80
XV
84
XVI
90
XVII
93
XVIII
94
XIX
105
XX
113
XXI
115
XXII
119
XXIII
122
XXIV
132
XXV
139
XXVI
146
XXVIII
149
XXIX
151
XXX
157
XXXI
170
XXXII
178
XXXIII
179
XXXIV
181
XXXV
182
XXXVI
195
XLV
245
XLVI
250
XLVIII
253
XLIX
254
L
257
LI
258
LII
263
LIII
270
LIV
271
LV
272
LVI
274
LVII
275
LVIII
276
LIX
281
LX
284
LXI
286
LXII
289
LXIII
290
LXV
291
LXVI
299
LXVII
331
Página de créditos

Otras ediciones - Ver todo

Términos y frases comunes

Pasajes populares

Página 330 - A study of smoothing methods for language models applied to ad hoc information retrieval.
Página 309 - Extending the Boolean and Vector Space Models of Information Retrieval with P-Norm Queries and Multiple Concept Types, Ph.D. Dissertation, Computer Science, Cornell University, 1983.
Página 322 - In Proceedings of the Seventeenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 302-310, Dublin, Ireland, 1994.
Página 329 - A generalized term dependence model in information retrieval. Information Technology: Research and Development, 2: 129-154; 1983.
Página 322 - Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. (2001). A Scalable Content- Addressable Network.

Información bibliográfica