| |
| |
| Preface ix | |
| |
| |
| |
| Introduction to Web Search Engines | |
| |
| |
| |
| A Short History of Information Retrieval | |
| |
| |
| |
| An Overview of Traditional Information Retrieval | |
| |
| |
| |
| Web Information Retrieval | |
| |
| |
| |
| Crawling, Indexing, and Query Processing | |
| |
| |
| |
| Crawling | |
| |
| |
| |
| x The Content Index | |
| |
| |
| |
| Query Processing | |
| |
| |
| |
| Ranking Webpages by Popularity | |
| |
| |
| |
| The Scene in 1998 | |
| |
| |
| |
| Two Theses | |
| |
| |
| |
| Query-Independence | |
| |
| |
| |
| The Mathematics of Google's PageRank | |
| |
| |
| |
| The Original Summation Formula for PageRank | |
| |
| |
| |
| Matrix Representation of the Summation Equations | |
| |
| |
| |
| Problems with the Iterative Process | |
| |
| |
| |
| A Little Markov Chain Theory | |
| |
| |
| |
| Early Adjustments to the Basic Model | |
| |
| |
| |
| Computation of the PageRank Vector | |
| |
| |
| |
| Theorem and Proof for Spectrum of the Google Matrix | |
| |
| |
| |
| Parameters in the PageRank Model | |
| |
| |
| |
| The alpha; Factor | |
| |
| |
| |
| The Hyperlink Matrix H | |
| |
| |
| |
| The Teleportation Matrix E | |
| |
| |
| |
| The Sensitivity of PageRank | |
| |
| |
| |
| Sensitivity with respect to alpha; | |
| |
| |
| |
| Sensitivity with respect to H | |
| |
| |
| |
| Sensitivity with respect to v T | |
| |
| |
| |
| Other Analyses of Sensitivity | |
| |
| |
| |
| Sensitivity Theorems and Proofs | |
| |
| |
| |
| The PageRank Problem as a Linear System | |
| |
| |
| |
| Properties of (I -- alhpa;S) | |
| |
| |
| |
| Properties of (I -- alpha;H) | |
| |
| |
| |
| Proof of the PageRank Sparse Linear System | |
| |
| |
| |
| Issues in Large-Scale Implementation of PageRank | |
| |
| |
| |
| Storage Issues | |
| |
| |
| |
| Convergence Criterion | |
| |
| |
| |
| Accuracy | |
| |
| |
| |
| Dangling Nodes | |
| |
| |
| |
| Back Button Modeling | |
| |
| |
| |
| Accelerating the Computation of PageRank | |
| |
| |
| |
| An Adaptive Power Method | |
| |
| |
| |
| Extrapolation | |
| |
| |
| |
| Aggregation | |
| |
| |
| |
| Other Numerical Methods | |
| |
| |
| |
| Updating the PageRank Vector | |
| |
| |
| |
| The Two Updating Problems and their History | |
| |
| |
| |
| Restarting the Power Method | |
| |
| |
| |
| Approximate Updating Using Approximate Aggregation | |
| |
| |
| |
| Exact Aggregation | |
| |
| |
| |
| Exact vs. Approximate Aggregation | |
| |
| |
| |
| Updating with Iterative Aggregation | |
| |
| |
| |
| Determining the Partition | |
| |
| |
| |
| Conclusions | |
| |
| |
| |
| The HITS Method for Ranking Webpages 115 | |
| |
| |
| |
| The HITS Algorithm | |
| |
| |
| |
| HITS Implementation | |
| |
| |
| |
| HITS Convergence | |
| |
| |
| |
| HITS Example | |
| |
| |
| |
| Strengths and Weaknesses of HITS | |
| |
| |
| |
| HITS's Relationship to Bibliometrics | |
| |
| |
| |
| Query-Independent HITS | |
| |
| |
| |
| Accelerating HITS | |
| |
| |
| |
| HITS Sensitivity | |
| |
| |
| |
| Other Link Methods for Ranking Webpages | |
| |
| |
| |
| SALSA | |
| |
| |
| |
| Hybrid Ranking Methods | |
| |
| |
| |
| Rankings based on Traffic Flow | |
| |
| |
| |
| The Future of Web Information Retrieval | |
| |
| |
| |
| Spam | |
| |
| |
| |
| Personalization | |
| |
| |
| |
| Clustering | |
| |
| |
| |
| Intelligent Agents | |
| |
| |
| |
| Trends and Time-Sensitive Search | |
| |
| |
| |
| Privacy and Censorship | |
| |
| |
| |
| Library Classification Schemes | |
| |
| |
| |
| Data Fusion | |
| |
| |
| |
| Resources for Web Information Retrieval | |
| |
| |
| |
| Resources for Getting Started | |
| |
| |
| |
| Resources for Serious Study | |
| |
| |
| |
| The Mathematics Guide | |
| |
| |
| |
| Linear Algebra | |
| |
| |
| |
| Perron-Frobenius Theory | |
| |
| |
| |
| Markov Chains | |
| |
| |
| |
| Perron Complementation | |
| |
| |
| |
| Stochastic Complementation | |
| |
| |
| |
| Censoring | |
| |
| |
| |
| Aggregation | |
| |
| |
| |
| Disaggregation | |
| |
| |
| |
| Chapter 16: Glossary | |
| |
| |
| Bibliography | |
| |
| |
| Index | |