Search (5 results, page 1 of 1)

0.021645572 = product of:
  0.043291144 = sum of:
    0.023759868 = weight(_text_:f in 411) [ClassicSimilarity], result of:
      0.023759868 = score(doc=411,freq=2.0), product of:
        0.13488543 = queryWeight, product of:
          3.985786 = idf(docFreq=2232, maxDocs=44218)
          0.033841614 = queryNorm
        0.17614852 = fieldWeight in 411, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.985786 = idf(docFreq=2232, maxDocs=44218)
          0.03125 = fieldNorm(doc=411)
    0.019531278 = product of:
      0.039062556 = sum of:
        0.039062556 = weight(_text_:de in 411) [ClassicSimilarity], result of:
          0.039062556 = score(doc=411,freq=4.0), product of:
            0.14543396 = queryWeight, product of:
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.033841614 = queryNorm
            0.26859307 = fieldWeight in 411, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.03125 = fieldNorm(doc=411)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Abstract

The Web has become the world's largest database, with search being the main tool that allows organizations and individuals to exploit its huge amount of information. Search on the Web has been traditionally based on textual and structural similarities, ignoring to a large degree the semantic dimension, i.e., understanding the meaning of the query and of the document content. Combining search and semantics gives birth to the idea of semantic search. Traditional search engines have already advertised some semantic dimensions. Some of them, for instance, can enhance their generated result sets with documents that are semantically related to the query terms even though they may not include these terms. Nevertheless, the exploitation of the semantic search has not yet reached its full potential. In this book, Roberto De Virgilio, Francesco Guerra and Yannis Velegrakis present an extensive overview of the work done in Semantic Search and other related areas. They explore different technologies and solutions in depth, making their collection a valuable and stimulating reading for both academic and industrial researchers. The book is divided into three parts. The first introduces the readers to the basic notions of the Web of Data. It describes the different kinds of data that exist, their topology, and their storing and indexing techniques. The second part is dedicated to Web Search. It presents different types of search, like the exploratory or the path-oriented, alongside methods for their efficient and effective implementation. Other related topics included in this part are the use of uncertainty in query answering, the exploitation of ontologies, and the use of semantics in mashup design and operation. The focus of the third part is on linked data, and more specifically, on applying ideas originating in recommender systems on linked data management, and on techniques for the efficiently querying answering on linked data.

Editor

Virgilio, R. de
Guerra, F.

0.020581257 = product of:
  0.041162513 = sum of:
    0.029699836 = weight(_text_:f in 767) [ClassicSimilarity], result of:
      0.029699836 = score(doc=767,freq=2.0), product of:
        0.13488543 = queryWeight, product of:
          3.985786 = idf(docFreq=2232, maxDocs=44218)
          0.033841614 = queryNorm
        0.22018565 = fieldWeight in 767, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.985786 = idf(docFreq=2232, maxDocs=44218)
          0.0390625 = fieldNorm(doc=767)
    0.011462679 = product of:
      0.022925358 = sum of:
        0.022925358 = weight(_text_:22 in 767) [ClassicSimilarity], result of:
          0.022925358 = score(doc=767,freq=2.0), product of:
            0.118507564 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.033841614 = queryNorm
            0.19345059 = fieldWeight in 767, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=767)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Date

22. 3.2008 14:24:08

0.0084003825 = product of:
  0.03360153 = sum of:
    0.03360153 = weight(_text_:f in 4448) [ClassicSimilarity], result of:
      0.03360153 = score(doc=4448,freq=4.0), product of:
        0.13488543 = queryWeight, product of:
          3.985786 = idf(docFreq=2232, maxDocs=44218)
          0.033841614 = queryNorm
        0.24911162 = fieldWeight in 4448, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.985786 = idf(docFreq=2232, maxDocs=44218)
          0.03125 = fieldNorm(doc=4448)
  0.25 = coord(1/4)

Classification

F 345

KAB

F 345

0.005939967 = product of:
  0.023759868 = sum of:
    0.023759868 = weight(_text_:f in 508) [ClassicSimilarity], result of:
      0.023759868 = score(doc=508,freq=2.0), product of:
        0.13488543 = queryWeight, product of:
          3.985786 = idf(docFreq=2232, maxDocs=44218)
          0.033841614 = queryNorm
        0.17614852 = fieldWeight in 508, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.985786 = idf(docFreq=2232, maxDocs=44218)
          0.03125 = fieldNorm(doc=508)
  0.25 = coord(1/4)

0.005939967 = product of:
  0.023759868 = sum of:
    0.023759868 = weight(_text_:f in 15) [ClassicSimilarity], result of:
      0.023759868 = score(doc=15,freq=2.0), product of:
        0.13488543 = queryWeight, product of:
          3.985786 = idf(docFreq=2232, maxDocs=44218)
          0.033841614 = queryNorm
        0.17614852 = fieldWeight in 15, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.985786 = idf(docFreq=2232, maxDocs=44218)
          0.03125 = fieldNorm(doc=15)
  0.25 = coord(1/4)

Editor

Becker, K. u. F. Stalder