Search (4 results, page 1 of 1)

0.026347723 = sum of:
  0.008973788 = product of:
    0.03589515 = sum of:
      0.03589515 = weight(_text_:authors in 6) [ClassicSimilarity], result of:
        0.03589515 = score(doc=6,freq=2.0), product of:
          0.23755142 = queryWeight, product of:
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.05210816 = queryNorm
          0.15110476 = fieldWeight in 6, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.0234375 = fieldNorm(doc=6)
    0.25 = coord(1/4)
  0.017373934 = product of:
    0.03474787 = sum of:
      0.03474787 = weight(_text_:i in 6) [ClassicSimilarity], result of:
        0.03474787 = score(doc=6,freq=4.0), product of:
          0.1965379 = queryWeight, product of:
            3.7717297 = idf(docFreq=2765, maxDocs=44218)
            0.05210816 = queryNorm
          0.17679983 = fieldWeight in 6, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.7717297 = idf(docFreq=2765, maxDocs=44218)
            0.0234375 = fieldNorm(doc=6)
    0.5 = coord(1/2)

Abstract

Why doesn't your home page appear on the first page of search results, even when you query your own name? How do other Web pages always appear at the top? What creates these powerful rankings? And how? The first book ever about the science of Web page rankings, "Google's PageRank and Beyond" supplies the answers to these and other questions and more. The book serves two very different audiences: the curious science reader and the technical computational reader. The chapters build in mathematical sophistication, so that the first five are accessible to the general academic reader. While other chapters are much more mathematical in nature, each one contains something for both audiences. For example, the authors include entertaining asides such as how search engines make money and how the Great Firewall of China influences research. The book includes an extensive background chapter designed to help readers learn more about the mathematics of search engines, and it contains several MATLAB codes and links to sample Web data sets. The philosophy throughout is to encourage readers to experiment with the ideas and algorithms in the text. Any business seriously interested in improving its rankings in the major search engines can benefit from the clear examples, sample code, and list of resources provided. It includes: many illustrative examples and entertaining asides; MATLAB code; accessible and informal style; and complete and self-contained section for mathematics review.

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

0.00882492 = product of:
  0.01764984 = sum of:
    0.01764984 = product of:
      0.03529968 = sum of:
        0.03529968 = weight(_text_:22 in 767) [ClassicSimilarity], result of:
          0.03529968 = score(doc=767,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = 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(1/2)

Date

22. 3.2008 14:24:08

0.00882492 = product of:
  0.01764984 = sum of:
    0.01764984 = product of:
      0.03529968 = sum of:
        0.03529968 = weight(_text_:22 in 1708) [ClassicSimilarity], result of:
          0.03529968 = score(doc=1708,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = 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(1/2)

Date

22. 3.2008 16:15:37

0.0029912626 = product of:
  0.005982525 = sum of:
    0.005982525 = product of:
      0.0239301 = sum of:
        0.0239301 = weight(_text_:authors in 1796) [ClassicSimilarity], result of:
          0.0239301 = score(doc=1796,freq=2.0), product of:
            0.23755142 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.05210816 = queryNorm
            0.10073651 = fieldWeight in 1796, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.015625 = fieldNorm(doc=1796)
      0.25 = coord(1/4)
  0.5 = coord(1/2)

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.