Skip header Section
Skip Bibliometrics Section
Google's PageRank and Beyond: The Science of Search Engine RankingsFebruary 2012
- Authors:
- Amy N. Langville,
- Carl D. Meyer
Skip Abstract Section
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. Many illustrative examples and entertaining asides MATLAB code Accessible and informal style Complete and self-contained section for mathematics review
Cited By
- Luo D, Bian Y, Yan Y, Yu X, Huan J, Liu X and Zhang X (2023). Random Walk on Multiple Networks, IEEE Transactions on Knowledge and Data Engineering, 35:8, (8417-8430), Online publication date: 1-Aug-2023.
- Bowater D and Stefanakis E (2023). Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks, Applied Mathematics and Computation, 446:C, Online publication date: 1-Jun-2023.
- Wąs T and Skibski O (2023). Axiomatic characterization of PageRank, Artificial Intelligence, 318:C, Online publication date: 1-May-2023.
- Peng L, Li Q and Wang F (2023). Context-aware and ethics-first crowd mobility portraits over massive smart card data, Multimedia Systems, 29:2, (499-510), Online publication date: 1-Apr-2023.
- Guo Z, Lu Y, Tian H, Zuo J and Lu H (2023). A security evaluation model for multi-source heterogeneous systems based on IOT and edge computing, Cluster Computing, 26:1, (303-317), Online publication date: 1-Feb-2023.
Rai S, Belwal R and Gupta A (2022). A Review on Source Code Documentation, ACM Transactions on Intelligent Systems and Technology, 13:5, (1-44), Online publication date: 31-Oct-2022.- Ullah A, Wang B, Sheng J, Long J, Khan N and Sun Z (2021). Identifying vital nodes from local and global perspectives in complex networks▪, Expert Systems with Applications: An International Journal, 186:C, Online publication date: 30-Dec-2022.
- Yoon M Graph Fraud Detection Based on Accessibility Score Distributions Machine Learning and Knowledge Discovery in Databases. Research Track, (483-498)
- Fragkou E, Katsaros D and Manolopoulos Y Sink Group Betweenness Centrality Proceedings of the 25th International Database Engineering & Applications Symposium, (21-26)
- Yu B, Zhang Y, Xie Y, Zhang C and Pan K (2022). Influence-aware graph neural networks, Applied Soft Computing, 104:C, Online publication date: 1-Jun-2021.
- Dadgostari F, Guim M, Beling P, Livermore M and Rockmore D (2021). Modeling law search as prediction, Artificial Intelligence and Law, 29:1, (3-34), Online publication date: 1-Mar-2021.
- Shao Y, Huang S, Miao X, Cui B and Chen L Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, (1797-1812)
- Gaines B (2019). From facilitating interactivity to managing hyperconnectivity, International Journal of Human-Computer Studies, 131:C, (4-22), Online publication date: 1-Nov-2019.
- Taibi D, Fulantelli G, Basteris L, Rosso G and Puvia E How Do Search Engines Shape Reality? Preliminary Insights from a Learning Experience Emerging Technologies for Education, (370-377)
- Guo J, Xu L and Liu J SPINE Proceedings of the 28th International Joint Conference on Artificial Intelligence, (2399-2405)
- Zhong H and Gu X (2019). A flexible and adaptive Simpler GMRES with deflated restarting for shifted linear systems, Computers & Mathematics with Applications, 78:3, (997-1007), Online publication date: 1-Aug-2019.
- Zhang Y, Zhang H, Yuan X and Tzeng N TweetScore Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, (379-390)
- Berkhout J and Heidergott B (2019). Analysis of Markov Influence Graphs, Operations Research, 67:3, (892-904), Online publication date: 1-May-2019.
- Goel S, Kumar R, Kumar M and Chopra V (2022). An efficient page ranking approach based on vector norms using sNorm(p) algorithm, Information Processing and Management: an International Journal, 56:3, (1053-1066), Online publication date: 1-May-2019.
- Berkhout J and Heidergott B (2019). The Jump Start Power Method, Journal of Scientific Computing, 78:3, (1691-1723), Online publication date: 1-Mar-2019.
- Nikolakopoulos A and Karypis G RecWalk Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, (150-158)
- Shen Z, Huang T, Carpentieri B, Wen C, Gu X and Tan X (2019). Off-diagonal low-rank preconditioner for difficult PageRank problems, Journal of Computational and Applied Mathematics, 346:C, (456-470), Online publication date: 15-Jan-2019.
- Avrachenkov K, Piunovskiy A and Zhang Y (2018). Hitting Times in Markov Chains with Restart and their Application to Network Centrality, Methodology and Computing in Applied Probability, 20:4, (1173-1188), Online publication date: 1-Dec-2018.
- Rezvani M, Ignjatovic A and Bertino E (2018). A Provenance-Aware Multi-dimensional Reputation System for Online Rating Systems, ACM Transactions on Internet Technology, 18:4, (1-20), Online publication date: 19-Nov-2018.
- Salman S and Alaswad S (2018). Alleviating road network congestion, Computers and Operations Research, 99:C, (191-205), Online publication date: 1-Nov-2018.
- Hu Y, Wang S, Ren Y and Choo K (2018). User influence analysis for Github developer social networks, Expert Systems with Applications: An International Journal, 108:C, (108-118), Online publication date: 15-Oct-2018.
- Kim M and Han S (2018). Cognitive social network analysis for supporting the reliable decision-making process, The Journal of Supercomputing, 74:8, (3654-3665), Online publication date: 1-Aug-2018.
- Wąs T and Skibski O Axiomatization of the pagerank centrality Proceedings of the 27th International Joint Conference on Artificial Intelligence, (3898-3904)
- Zhang W, Deakin J, Higham N and Wang S Etymo Companion Proceedings of the The Web Conference 2018, (227-230)
- Silva A, Singh A and Swami A Spectral Algorithms for Temporal Graph Cuts Proceedings of the 2018 World Wide Web Conference, (519-528)
- Mokhtar S, Boutet A, Felber P, Pasin M, Pires R and Schiavoni V X-search Proceedings of the 18th ACM/IFIP/USENIX Middleware Conference, (198-208)
- Bruno R, Costa F and Ferreira P (2017). freeCycles - Efficient Multi-Cloud Computing Platform, Journal of Grid Computing, 15:4, (501-526), Online publication date: 1-Dec-2017.
- Yu X and Brady E Understanding and Classifying Online Amputee Users on Reddit Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, (17-22)
- Massobrio R, Toutouh J, Nesmachnow S and Alba E (2017). Infrastructure Deployment in Vehicular Communication Networks Using a Parallel Multiobjective Evolutionary Algorithm, International Journal of Intelligent Systems, 32:8, (801-829), Online publication date: 7-Jun-2017.
- Uyar A and Karapinar R (2017). Investigating the precision of Web image search engines for popular and less popular entities, Journal of Information Science, 43:3, (378-392), Online publication date: 1-Jun-2017.
- Jung J, Park N, Lee S and Kang U BePI Proceedings of the 2017 ACM International Conference on Management of Data, (789-804)
- Aransay J and Divasón J (2016). Formalisation of the computation of the echelon form of a matrix in Isabelle/HOL, Formal Aspects of Computing, 28:6, (1005-1026), Online publication date: 1-Nov-2016.
- Óskarsdóttir M, Bravo C, Verbeke W, Sarraute C, Baesens B and Vanthienen J A comparative study of social network classifiers for predicting churn in the telecommunication industry Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, (1151-1158)
- Jung J, Shin K, Sael L and Kang U (2016). Random Walk with Restart on Large Graphs Using Block Elimination, ACM Transactions on Database Systems, 41:2, (1-43), Online publication date: 30-Jun-2016.
- Liao X, Liu C, McCoy D, Shi E, Hao S and Beyah R Characterizing Long-tail SEO Spam on Cloud Web Hosting Services Proceedings of the 25th International Conference on World Wide Web, (321-332)
- Berkhout J and Heidergott B (2015). Efficient Algorithm for Computing the Ergodic Projector of Markov Multi-chains, Procedia Computer Science, 51:C, (1818-1827), Online publication date: 1-Sep-2015.
- Nash R Considering a Wider Web? Proceedings of the ACM Web Science Conference, (1-4)
- Shin K, Jung J, Lee S and Kang U BEAR Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, (1571-1585)
Recommendations
Beyond PageRank: machine learning for static ranking
WWW '06: Proceedings of the 15th international conference on World Wide WebSince the publication of Brin and Page's paper on PageRank, many in the Web community have depended on PageRank for the static (query-independent) ordering of Web pages. We show that we can significantly outperform PageRank using features that are ...
Ordinal Ranking for Google's PageRank
We present computationally efficient criteria that can guarantee correct ordinal ranking of Google's PageRank scores when they are computed with the power method (ordinal ranking of a list consists of assigning an ordinal number to each item in the list)...