Information Retrieval: Algorithms and Heuristics
Available
 
About the Book

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.

Book Details
ISBN-13: 9781402030031
EAN: 9781402030031
Publisher Date: 21 Oct 2004
Binding: Hardcover
Book Type: English
Depth: 19
Edition: 2nd ed. 2004
Height: 279 mm
Language: English
No of Pages: 332
PrintOnDemand: N
Series Title: The Information Retrieval Series
Star Rating: 0
Width: 210 mm
ISBN-10: 1402030037
Publisher: Springer-Verlag New York Inc.
Acedemic Level: English
Bood Data Readership Text: Professional & Vocational
Continuations: English
Dewey: 005.74
Gardner Classification Code: U01
Illustrations: biography
MediaMail: Y
Pagination: 332 pages, biography
Returnable: N
Spine Width: 20 mm
Sub Title: Algorithms And Heuristics
Year Of Publication: 2004