Search (2 results, page 1 of 1)

0.0024861933 = product of:
  0.014917159 = sum of:
    0.014917159 = product of:
      0.029834319 = sum of:
        0.029834319 = weight(_text_:theory in 26) [ClassicSimilarity], result of:
          0.029834319 = score(doc=26,freq=2.0), product of:
            0.16234003 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03903913 = queryNorm
            0.18377672 = fieldWeight in 26, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.03125 = fieldNorm(doc=26)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Abstract

We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more effective information-seeking support to users than best-first search. Indeed, faceted search has become increasingly prevalent in online information access systems, particularly for e-commerce and site search. In this lecture, we explore the history, theory, and practice of faceted search. Although we cannot hope to be exhaustive, our aim is to provide sufficient depth and breadth to offer a useful resource to both researchers and practitioners. Because faceted search is an area of interest to computer scientists, information scientists, interface designers, and usability researchers, we do not assume that the reader is a specialist in any of these fields. Rather, we offer a self-contained treatment of the topic, with an extensive bibliography for those who would like to pursue particular aspects in more depth.

0.0023239423 = product of:
  0.013943653 = sum of:
    0.013943653 = product of:
      0.027887305 = sum of:
        0.027887305 = weight(_text_:methods in 1486) [ClassicSimilarity], result of:
          0.027887305 = score(doc=1486,freq=2.0), product of:
            0.15695344 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.03903913 = queryNorm
            0.17767884 = fieldWeight in 1486, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.03125 = fieldNorm(doc=1486)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

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.