Google's page rank: the Math behind the search engine

@article{Wills2006GooglesPR,
  title={Google's page rank: the Math behind the search engine},
  author={Rebecca S. Wills},
  journal={The Mathematical Intelligencer},
  year={2006},
  volume={28},
  pages={6-11}
}
  • Rebecca S. Wills
  • Published 1 September 2006
  • Computer Science
  • The Mathematical Intelligencer
Approximately 94 million American adults use the internet on a typical day [24]. The number one internet activity is reading and writing email. Search engine use is next in line and continues to increase in popularity. In fact, survey findings indicate that nearly 60 million American adults use search engines on a given day. Even though there are many internet search engines, Google, Yahoo!, and MSN receive over 81% of all search requests [27]. Despite claims that the quality of search provided… 
View via Publisher
cems.uvm.edu
30 Citations
Highly Influential Citations
2
Background Citations
9
Methods Citations
7

30 Citations

Search Engine Results Comparison for Result Filtering

Findings suggest Google Search has a difference between a Signed In and Signed Out Search, and DuckDuckGo has the limitation of reliance on similarsites.com.

Profile Based Search Engine

This paper attempts to solve the problem of huge amount of information available on internet by extending the NUTCH open source search engine using personalized information of user from the social networking sites like Facebook.

Effective Solving the One-Two Gap Problem in the PageRank Algorithm

The experimental results show that the proposed method outperforms PageRank method theoretically and experimentally in the term of precision, accuracy, and sensitivity with such criteria as PD, P@n, NDCG @n, MAP, and Recall.

An optimized crawling technique for maintaining fresh repositories

  • S. Sethi
  • Computer Science
    Multimedia Tools and Applications
  • 2021
The paper presents an optimal solution to deal with this non- deterministic problem for large data and experimental results show that technique achieves promising results as compared to existing crawler.

The second eigenvector of the Google matrix and its relation to link spamming

It is found that using irreducible closed subsets is an effective way to unfairly increase the PageRank of a website (perform link spamming) and this can be detected when looking at the second eigenvector of the Google matrix.

Studying Relations Between E-learning Resources to Improve the Quality of Searching and Recommendation

This paper proposes an approach that studies relations between e-learning resources, which is a particular property existing in online educational systems, to support resource searching and recommendation and integrates it into a text-matching search engine to refine the search results.

From Impact to Importance: The Current State of the Wisdom-of-Crowds Justification of Link-Based Ranking Algorithms

It is argued that neither the influential preferential attachment models due to Barabási and Albert nor the recent model introduced by Masterton et al. allows for a satisfactory wisdom-of-crowds justification of PageRank, and it is suggested that future work should explore “dual models” of linking on the web, i.e., models that combine the two previous approaches.

From Impact to Importance: The Current State of the Wisdom-of-Crowds Justification of Link-Based Ranking Algorithms

It is argued that neither the influential preferential attachment models due to Barabási and Albert nor the recent model introduced by Masterton et al. allows for a satisfactory wisdom-of-crowds justification of PageRank, and it is suggested that future work should explore “dual models” of linking on the web, i.e., models that combine the two previous approaches.

Multi-space Projection Based Search Engine: Theoretical Model Instantiation and Prototype

A Multi-Space Search Engine model that is based on multiple interpretation spaces is proposed that performs well when compared to popular search engines with regard to the visibility of interpretations and the navigability of the results.

An evaluation of SimRank and Personalized PageRank to build a recommender system for the Web of Data

Two existing metrics, SimRank and PageRank, are reviewed and investigated and their suitability and performance for computing similarity between resources in RDF graphs and their usage to feed a content-based recommender system are investigated.

References

SHOWING 1-10 OF 29 REFERENCES

The Anatomy of a Large-Scale Hypertextual Web Search Engine

Google's PageRank and Beyond

This talk will survey some of the concepts that have revolutionized Web search to the extent that it has been charged in Federal Court with driving the direction of commerce on the Internet.

Combating Web Spam with TrustRank

The PageRank Citation Ranking : Bringing Order to the Web

This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.

A Survey on PageRank Computing

  • P. Berkhin
  • Computer Science, Mathematics
    Internet Math.
  • 2005
The theoretical foundations of the PageRank formulation are examined, the acceleration of PageRank computing, in the effects of particular aspects of web graph structure on the optimal organization of computations, and in PageRank stability.

An Investigation of Documents from the World Wide Web

The Second Eigenvalue of the Google Matrix

Analysis of the modulus of the second eigenvalue for the web hyperlink matrix used by Google for computing PageRank has implications for the convergence rate of the standard PageRank algorithm as the web scales, for the stability of PageRank to perturbations to the link structure of the web, and for the design of algorithms to speed up PageRank.

Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation

The analytic expression of the Jordan form of A(c) and, in particular, a rational formula for the PageRank in terms of c is determined.

Deeper Inside PageRank

A comprehensive survey of all issues associated with PageRank, covering the basic PageRank model, available and recommended solution methods, storage issues, existence, uniqueness, and convergence properties, possible alterations to the basic model, and suggested alternatives to the traditional solution methods.

PageRank Computation and the Structure of the Web: Experiments and Algorithms

We describe some computational experiments carried out with variants of the “PageRank” model due to Page et al., with particular reference to the small and large scale structure of the Web.