Search (3 results, page 1 of 1)

0.01609679 = product of:
  0.03219358 = sum of:
    0.008841655 = product of:
      0.026524965 = sum of:
        0.026524965 = weight(_text_:k in 1981) [ClassicSimilarity], result of:
          0.026524965 = score(doc=1981,freq=4.0), product of:
            0.13587062 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.038061365 = queryNorm
            0.19522223 = fieldWeight in 1981, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.02734375 = fieldNorm(doc=1981)
      0.33333334 = coord(1/3)
    0.023351924 = product of:
      0.04670385 = sum of:
        0.04670385 = weight(_text_:intelligent in 1981) [ClassicSimilarity], result of:
          0.04670385 = score(doc=1981,freq=2.0), product of:
            0.21440355 = queryWeight, product of:
              5.633102 = idf(docFreq=429, maxDocs=44218)
              0.038061365 = queryNorm
            0.2178315 = fieldWeight in 1981, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.633102 = idf(docFreq=429, maxDocs=44218)
              0.02734375 = fieldNorm(doc=1981)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Abstract

As the World Wide Web continues to expand, it becomes increasingly difficult for users to obtain information efficiently. Because most search engines read format languages such as HTML or SGML, search results reflect formatting tags more than actual page content, which is expressed in natural language. Spinning the Semantic Web describes an exciting new type of hierarchy and standardization that will replace the current "Web of links" with a "Web of meaning." Using a flexible set of languages and tools, the Semantic Web will make all available information - display elements, metadata, services, images, and especially content - accessible. The result will be an immense repository of information accessible for a wide range of new applications. This first handbook for the Semantic Web covers, among other topics, software agents that can negotiate and collect information, markup languages that can tag many more types of information in a document, and knowledge systems that enable machines to read Web pages and determine their reliability. The truly interdisciplinary Semantic Web combines aspects of artificial intelligence, markup languages, natural language processing, information retrieval, knowledge representation, intelligent agents, and databases.

Classification

TVK (FH K)

GHBS

TVK (FH K)

0.012761456 = product of:
  0.025522912 = sum of:
    0.012630938 = product of:
      0.03789281 = sum of:
        0.03789281 = weight(_text_:k in 1708) [ClassicSimilarity], result of:
          0.03789281 = score(doc=1708,freq=4.0), product of:
            0.13587062 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.038061365 = queryNorm
            0.2788889 = fieldWeight in 1708, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1708)
      0.33333334 = coord(1/3)
    0.012891974 = product of:
      0.025783949 = sum of:
        0.025783949 = weight(_text_:22 in 1708) [ClassicSimilarity], result of:
          0.025783949 = score(doc=1708,freq=2.0), product of:
            0.13328442 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.038061365 = queryNorm
            0.19345059 = fieldWeight in 1708, 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=1708)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Classification

AMT (FH K)

Date

22. 3.2008 16:15:37

GHBS

AMT (FH K)

0.0050039836 = product of:
  0.020015934 = sum of:
    0.020015934 = product of:
      0.04003187 = sum of:
        0.04003187 = weight(_text_:intelligent in 6) [ClassicSimilarity], result of:
          0.04003187 = score(doc=6,freq=2.0), product of:
            0.21440355 = queryWeight, product of:
              5.633102 = idf(docFreq=429, maxDocs=44218)
              0.038061365 = queryNorm
            0.18671271 = fieldWeight in 6, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.633102 = idf(docFreq=429, maxDocs=44218)
              0.0234375 = fieldNorm(doc=6)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Content

Chapter 9. Accelerating the Computation of PageRank: 9.1 An Adaptive Power Method - 9.2 Extrapolation - 9.3 Aggregation - 9.4 Other Numerical Methods Chapter 10. Updating the PageRank Vector: 10.1 The Two Updating Problems and their History - 10.2 Restarting the Power Method - 10.3 Approximate Updating Using Approximate Aggregation - 10.4 Exact Aggregation - 10.5 Exact vs. Approximate Aggregation - 10.6 Updating with Iterative Aggregation - 10.7 Determining the Partition - 10.8 Conclusions Chapter 11. The HITS Method for Ranking Webpages: 11.1 The HITS Algorithm - 11.2 HITS Implementation - 11.3 HITS Convergence - 11.4 HITS Example - 11.5 Strengths and Weaknesses of HITS - 11.6 HITS's Relationship to Bibliometrics - 11.7 Query-Independent HITS - 11.8 Accelerating HITS - 11.9 HITS Sensitivity Chapter 12. Other Link Methods for Ranking Webpages: 12.1 SALSA - 12.2 Hybrid Ranking Methods - 12.3 Rankings based on Traffic Flow Chapter 13. The Future of Web Information Retrieval: 13.1 Spam - 13.2 Personalization - 13.3 Clustering - 13.4 Intelligent Agents - 13.5 Trends and Time-Sensitive Search - 13.6 Privacy and Censorship - 13.7 Library Classification Schemes - 13.8 Data Fusion Chapter 14. Resources for Web Information Retrieval: 14.1 Resources for Getting Started - 14.2 Resources for Serious Study Chapter 15. The Mathematics Guide: 15.1 Linear Algebra - 15.2 Perron-Frobenius Theory - 15.3 Markov Chains - 15.4 Perron Complementation - 15.5 Stochastic Complementation - 15.6 Censoring - 15.7 Aggregation - 15.8 Disaggregation