Search (3 results, page 1 of 1)

0.00628247 = product of:
  0.01884741 = sum of:
    0.01884741 = product of:
      0.03769482 = sum of:
        0.03769482 = weight(_text_:2005 in 1486) [ClassicSimilarity], result of:
          0.03769482 = score(doc=1486,freq=2.0), product of:
            0.19702037 = queryWeight, product of:
              4.329179 = idf(docFreq=1583, maxDocs=44218)
              0.04550987 = queryNorm
            0.19132447 = fieldWeight in 1486, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.329179 = idf(docFreq=1583, maxDocs=44218)
              0.03125 = fieldNorm(doc=1486)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

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 on retrieval design and implementation questions is provided. 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. Neuaufl. 2005: 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.

0.006165959 = product of:
  0.018497877 = sum of:
    0.018497877 = product of:
      0.036995754 = sum of:
        0.036995754 = weight(_text_:22 in 987) [ClassicSimilarity], result of:
          0.036995754 = score(doc=987,freq=2.0), product of:
            0.15936781 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04550987 = queryNorm
            0.23214069 = fieldWeight in 987, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=987)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

23. 7.2017 13:49:22

0.003141235 = product of:
  0.009423705 = sum of:
    0.009423705 = product of:
      0.01884741 = sum of:
        0.01884741 = weight(_text_:2005 in 92) [ClassicSimilarity], result of:
          0.01884741 = score(doc=92,freq=2.0), product of:
            0.19702037 = queryWeight, product of:
              4.329179 = idf(docFreq=1583, maxDocs=44218)
              0.04550987 = queryNorm
            0.095662236 = fieldWeight in 92, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.329179 = idf(docFreq=1583, maxDocs=44218)
              0.015625 = fieldNorm(doc=92)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Footnote

Rez. in: JASIST 56(2005) no.2, S.215-216 (A. Heath): "What is small, thoroughly organized, and easy to understand? Well, it's Heting Chu's latest book an information retrieval. A very welcome release, this small literary addition to the field (only 248 pages) contains a concise and weIl-organized discussion of every major topic in information retrieval. The often-complex field of information retrieval is presented from its origin in the early 1950s to the present day. The organization of this text is top-notch, thus making this an easy read for even the novice. Unlike other titles in this area, Chu's user-friendly style of writing is done an purpose to properly introduce newcomers to the field in a less intimidating way. As stated by the author in the Preface, the purpose of the book is to "present a systematic, thorough yet nontechnical view of the field by using plain language to explain complex subjects." Chu has definitely struck up the right combination of ingredients. In a field so broad and complex, a well-organized presentation of topics that don't trip an themselves is essential. The use of plain language where possible is also a good choice for this topic because it allows one to absorb topics that are, by nature, not as easy to grasp. For instance, Chapters 6 and 7, which cover retrieval approaches and techniques, an often painstaking topic for many students and teachers is deftly handled with the use of tables that can be used to compare and contrast the various models discussed. I particularly loved Chu's use of Koll's 2000 article from the Bulletin of the American Society for Information Science to explain subject searching at the beginning of Chapter 6, which discusses the differences between browsing and searching. The Koll article uses the task of finding a needle in a haystack as an analogy.