Discovering and Leveraging the Most Valuable Links for Ranking
Hengshuai Yao

TL;DR
This paper introduces MaxRank, a link-based ranking method that emphasizes the most valuable backlinks, offering faster convergence than PageRank and new insights into influential link sources.
Contribution
The paper proposes MaxRank, a novel ranking algorithm focusing on the best backlinks, and demonstrates its effectiveness and faster convergence compared to PageRank.
Findings
MaxRank reduces to PageRank when λ=0.
Large λ values improve convergence speed.
MaxRank identifies influential backlink sources.
Abstract
On the Web, visits of a page are often introduced by one or more valuable linking sources. Indeed, good back links are valuable resources for Web pages and sites. We propose to discovering and leveraging the best backlinks of pages for ranking. Similar to PageRank, MaxRank scores are updated {recursively}. In particular, with probability , the MaxRank of a document is updated from the backlink source with the maximum score; with probability , the MaxRank of a document is updated from a random backlink source. MaxRank has an interesting relation to PageRank. When , MaxRank reduces to PageRank; when , MaxRank only looks at the best backlink it thinks. Empirical results on Wikipedia shows that the global authorities are very influential; Overall large s (but smaller than 1) perform best: the convergence is dramatically faster than…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInformation Retrieval and Search Behavior · Advanced Text Analysis Techniques · Semantic Web and Ontologies
