Search (7 results, page 1 of 1)

0.020940641 = product of:
  0.041881282 = sum of:
    0.035051636 = weight(_text_:representation in 1981) [ClassicSimilarity], result of:
      0.035051636 = score(doc=1981,freq=2.0), product of:
        0.19700786 = queryWeight, product of:
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.042818543 = queryNorm
        0.17791998 = fieldWeight in 1981, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.02734375 = fieldNorm(doc=1981)
    0.0068296455 = product of:
      0.020488936 = sum of:
        0.020488936 = weight(_text_:29 in 1981) [ClassicSimilarity], result of:
          0.020488936 = score(doc=1981,freq=2.0), product of:
            0.15062225 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.042818543 = queryNorm
            0.13602862 = fieldWeight in 1981, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.02734375 = fieldNorm(doc=1981)
      0.33333334 = coord(1/3)
  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.

Date

29. 3.1996 18:16:49

0.020806724 = product of:
  0.04161345 = sum of:
    0.030044261 = weight(_text_:representation in 6) [ClassicSimilarity], result of:
      0.030044261 = score(doc=6,freq=2.0), product of:
        0.19700786 = queryWeight, product of:
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.042818543 = queryNorm
        0.15250285 = fieldWeight in 6, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.600994 = idf(docFreq=1206, maxDocs=44218)
          0.0234375 = fieldNorm(doc=6)
    0.011569187 = product of:
      0.03470756 = sum of:
        0.03470756 = weight(_text_:theory in 6) [ClassicSimilarity], result of:
          0.03470756 = score(doc=6,freq=4.0), product of:
            0.1780563 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.042818543 = queryNorm
            0.19492465 = fieldWeight in 6, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.0234375 = fieldNorm(doc=6)
      0.33333334 = coord(1/3)
  0.5 = coord(2/4)

Content

Inhalt: Chapter 1. Introduction to Web Search Engines: 1.1 A Short History of Information Retrieval - 1.2 An Overview of Traditional Information Retrieval - 1.3 Web Information Retrieval Chapter 2. Crawling, Indexing, and Query Processing: 2.1 Crawling - 2.2 The Content Index - 2.3 Query Processing Chapter 3. Ranking Webpages by Popularity: 3.1 The Scene in 1998 - 3.2 Two Theses - 3.3 Query-Independence Chapter 4. The Mathematics of Google's PageRank: 4.1 The Original Summation Formula for PageRank - 4.2 Matrix Representation of the Summation Equations - 4.3 Problems with the Iterative Process - 4.4 A Little Markov Chain Theory - 4.5 Early Adjustments to the Basic Model - 4.6 Computation of the PageRank Vector - 4.7 Theorem and Proof for Spectrum of the Google Matrix Chapter 5. Parameters in the PageRank Model: 5.1 The a Factor - 5.2 The Hyperlink Matrix H - 5.3 The Teleportation Matrix E Chapter 6. The Sensitivity of PageRank; 6.1 Sensitivity with respect to alpha - 6.2 Sensitivity with respect to H - 6.3 Sensitivity with respect to vT - 6.4 Other Analyses of Sensitivity - 6.5 Sensitivity Theorems and Proofs Chapter 7. The PageRank Problem as a Linear System: 7.1 Properties of (I - alphaS) - 7.2 Properties of (I - alphaH) - 7.3 Proof of the PageRank Sparse Linear System Chapter 8. Issues in Large-Scale Implementation of PageRank: 8.1 Storage Issues - 8.2 Convergence Criterion - 8.3 Accuracy - 8.4 Dangling Nodes - 8.5 Back Button Modeling
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

0.0039026549 = product of:
  0.015610619 = sum of:
    0.015610619 = product of:
      0.046831857 = sum of:
        0.046831857 = weight(_text_:29 in 4930) [ClassicSimilarity], result of:
          0.046831857 = score(doc=4930,freq=2.0), product of:
            0.15062225 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.042818543 = queryNorm
            0.31092256 = fieldWeight in 4930, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0625 = fieldNorm(doc=4930)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Footnote

Rez. in: Journal of academic librarianship 19(1993) S.169-170 (S.L. Davidsen); Information processing and management 29(1993) no.4, S.531 (W.F. u. L.L. Wagoner): Library software review 1993, Fall, S.80 (A. Hamilton)

0.0024391594 = product of:
  0.009756638 = sum of:
    0.009756638 = product of:
      0.029269911 = sum of:
        0.029269911 = weight(_text_:29 in 1514) [ClassicSimilarity], result of:
          0.029269911 = score(doc=1514,freq=2.0), product of:
            0.15062225 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.042818543 = queryNorm
            0.19432661 = fieldWeight in 1514, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1514)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Date

29. 2.2008 18:48:52

0.0024172175 = product of:
  0.00966887 = sum of:
    0.00966887 = product of:
      0.02900661 = sum of:
        0.02900661 = weight(_text_:22 in 767) [ClassicSimilarity], result of:
          0.02900661 = score(doc=767,freq=2.0), product of:
            0.14994325 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042818543 = 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.33333334 = coord(1/3)
  0.25 = coord(1/4)

Date

22. 3.2008 14:24:08

0.0024172175 = product of:
  0.00966887 = sum of:
    0.00966887 = product of:
      0.02900661 = sum of:
        0.02900661 = weight(_text_:22 in 1708) [ClassicSimilarity], result of:
          0.02900661 = score(doc=1708,freq=2.0), product of:
            0.14994325 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042818543 = 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.33333334 = coord(1/3)
  0.25 = coord(1/4)

Date

22. 3.2008 16:15:37

0.0013634418 = product of:
  0.0054537673 = sum of:
    0.0054537673 = product of:
      0.016361302 = sum of:
        0.016361302 = weight(_text_:theory in 1796) [ClassicSimilarity], result of:
          0.016361302 = score(doc=1796,freq=2.0), product of:
            0.1780563 = queryWeight, product of:
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.042818543 = queryNorm
            0.09188836 = fieldWeight in 1796, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1583924 = idf(docFreq=1878, maxDocs=44218)
              0.015625 = fieldNorm(doc=1796)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Footnote

Rez. in: JASIST 55(2004) no.11, S.1025-1026 (D.E. Agosto): ""Did you ever feel as though the Internet has caused you to lose control of your library?" So begins the introduction to this volume of over 50 articles, essays, library policies, and other documents from a variety of sources, most of which are library journals aimed at practitioners. Volume editor Block has a long history of library service as well as an active career as an online journalist. From 1977 to 1999 she was the Associate Director of Public Services at the St. Ambrose University library in Davenport, Iowa. She was also a Fox News Online weekly columnist from 1998 to 2000. She currently writes for and publishes the weekly ezine Exlibris, which focuses an the use of computers, the Internet, and digital databases to improve library services. Despite the promising premise of this book, the final product is largely a disappointment because of the superficial coverage of its issues. A listing of the most frequently represented sources serves to express the general level and style of the entries: nine articles are reprinted from Computers in Libraries, five from Library Journal, four from Library Journal NetConnect, four from ExLibris, four from American Libraries, three from College & Research Libraries News, two from Online, and two from The Chronicle of Higher Education. Most of the authors included contributed only one item, although Roy Tennant (manager of the California Digital Library) authored three of the pieces, and Janet L. Balas (library information systems specialist at the Monroeville Public Library in Pennsylvania) and Karen G. Schneider (coordinator of lii.org, the Librarians' Index to the Internet) each wrote two. Volume editor Block herself wrote six of the entries, most of which have been reprinted from ExLibris. Reading the volume is muck like reading an issue of one of these journals-a pleasant experience that discusses issues in the field without presenting much research. Net Effects doesn't offer much in the way of theory or research, but then again it doesn't claim to. Instead, it claims to be an "idea book" (p. 5) with practical solutions to Internet-generated library problems. While the idea is a good one, little of the material is revolutionary or surprising (or even very creative), and most of the solutions offered will already be familiar to most of the book's intended audience.