Search (4 results, page 1 of 1)

0.0015089302 = product of:
  0.010562511 = sum of:
    0.010562511 = product of:
      0.052812554 = sum of:
        0.052812554 = weight(_text_:retrieval in 1486) [ClassicSimilarity], result of:
          0.052812554 = score(doc=1486,freq=26.0), product of:
            0.109568894 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03622214 = queryNorm
            0.48200315 = fieldWeight in 1486, product of:
              5.0990195 = tf(freq=26.0), with freq of:
                26.0 = termFreq=26.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03125 = fieldNorm(doc=1486)
      0.2 = coord(1/5)
  0.14285715 = coord(1/7)

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.

LCSH

Information storage and retrieval systems

RSWK

Algorithmus / Heuristik / Information Retrieval
Information Retrieval / Theoretische Informatik (HBZ)
Information Retrieval (BVB)

Series

Kluwer international series on information retrieval ; 15

Subject

Algorithmus / Heuristik / Information Retrieval
Information Retrieval / Theoretische Informatik (HBZ)
Information Retrieval (BVB)
Information storage and retrieval systems

8.0203614E-4 = product of:
  0.0056142528 = sum of:
    0.0056142528 = product of:
      0.028071264 = sum of:
        0.028071264 = weight(_text_:system in 1952) [ClassicSimilarity], result of:
          0.028071264 = score(doc=1952,freq=4.0), product of:
            0.11408355 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.03622214 = queryNorm
            0.24605882 = fieldWeight in 1952, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1952)
      0.2 = coord(1/5)
  0.14285715 = coord(1/7)

RSWK

Semantic Web / Wissensbasiertes System / Ontologie <Wissensverarbeitung> / Aufsatzsammlung

Subject

Semantic Web / Wissensbasiertes System / Ontologie <Wissensverarbeitung> / Aufsatzsammlung

6.416289E-4 = product of:
  0.0044914023 = sum of:
    0.0044914023 = product of:
      0.022457011 = sum of:
        0.022457011 = weight(_text_:system in 3110) [ClassicSimilarity], result of:
          0.022457011 = score(doc=3110,freq=4.0), product of:
            0.11408355 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.03622214 = queryNorm
            0.19684705 = fieldWeight in 3110, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.03125 = fieldNorm(doc=3110)
      0.2 = coord(1/5)
  0.14285715 = coord(1/7)

Classification

Mat T 1091 / Verteiltes System

SBB

Mat T 1091 / Verteiltes System

5.2312744E-4 = product of:
  0.003661892 = sum of:
    0.003661892 = product of:
      0.01830946 = sum of:
        0.01830946 = weight(_text_:retrieval in 714) [ClassicSimilarity], result of:
          0.01830946 = score(doc=714,freq=2.0), product of:
            0.109568894 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03622214 = queryNorm
            0.16710453 = fieldWeight in 714, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0390625 = fieldNorm(doc=714)
      0.2 = coord(1/5)
  0.14285715 = coord(1/7)

Abstract

"Wir ertrinken in Informationen, aber uns dürstet nach Wissen." Trendforscher John Naisbitt drückt hiermit aus, dass es dem Menschen heute nicht mehr möglich ist die Informationsflut, die sich über ihn ergießt, effizient zu verwerten. Er lebt in einer globalisierten Welt mit einem vielfältigen Angebot an Medien, wie Presse, Radio, Fernsehen und dem Internet. Die Problematik der mangelnden Auswertbarkeit von großen Informationsmengen ist dabei vor allem im Internet akut. Die Quantität, Verbreitung, Aktualität und Verfügbarkeit sind die großen Vorteile des World Wide Web (WWW). Die Probleme liegen in der Qualität und Dichte der Informationen. Das Information Retrieval muss effizienter gestaltet werden, um den wirtschaftlichen und kulturellen Nutzen einer vernetzten Welt zu erhalten.Matthias Erbarth beleuchtet zunächst genau diesen Themenkomplex, um im Anschluss ein Format für elektronische Dokumente, insbesondere kommerzielle Publikationen, zu entwickeln. Dieses Anwendungsbeispiel stellt eine semantische Inhaltsbeschreibung mit Metadaten mittels XML vor, wobei durch Nutzung von Verweisen und Auswertung von Zusammenhängen insbesondere eine netzförmige Darstellung berücksichtigt wird.