Finding Related Pages Using the Link Structure of the WWW
Published 20 September 2004
Paul - Alexandru Chirita, Daniel Olmedilla, Wolfgang Nejdl
Citations15
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
HubFinder is presented, a new fast algorithm for finding related pages exploring the link structure of the Web graph which gives a more complete view of page "importance" by biasing the authority measure of PageRank towards hub values of pages.
Abstract
Most of the current algorithms for finding related pages are exclusively based on text corpora of the WWW or incorporate only authority or hub values of pages. In this paper, we present HubFinder, a new fast algorithm for finding related pages exploring the link structure of the Web graph. Its criterion for filtering output pages is "pluggable", depending on the user's interests, and may vary from global page ranks to text content, etc. We also introduce HubRank, a new ranking algorithm which gives a more complete view of page "importance" by biasing the authority measure of PageRank towards hub values of pages. Finally, we present an evaluation of these algorithms in order to prove their qualities experimentally.
Keywords
Computer SciencePhysics and Astronomy
The PageRank Citation Ranking : Bringing Order to the Web
12,645 Citations1999Lawrence M. Page, Sergey Brin +2 more
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.
Journal of the ACMAuthoritative sources in a hyperlinked environment
9,060 Citations1999Jon Kleinberg
This work proposes and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages” that join them together in the link structure, and has connections to the eigenvectors of certain matrices associated with the link graph.
A comparison of event models for naive bayes text classification
3,224 Citations1998Andrew McCallum, Kamal Nigam
It is found that the multi-variate Bernoulli performs well with small vocabulary sizes, but that the multinomial performs usually performs even better at larger vocabulary sizes--providing on average a 27% reduction in error over the multi -variateBernoulli model at any vocabulary size.
ACM SIGIR ForumAn Algorithmic Framework for Performing Collaborative Filtering
2,552 Citations2017Jonathan L. Herlocker, Joseph A. Konstan +2 more
SimRank
1,938 Citations2002Glen Jeh, Jennifer Widom
A complementary approach, applicable in any domain with object-to-object relationships, that measures similarity of the structural context in which objects occur, based on their relationships with other objects is proposed.
Computer NetworksFocused crawling: a new approach to topic-specific Web resource discovery
1,492 Citations1999Soumen Chakrabarti, Martin van den Berg +1 more
A new hypertext resource discovery system called a Focused Crawler that is robust against large perturbations in the starting set of URLs, and capable of exploring out and discovering valuable resources that are dozens of links away from the start set, while carefully pruning the millions of pages that may lie within this same radius.
ACM SIGIR ForumImproved Algorithms for Topic Distillation in a Hyperlinked Environment
677 Citations2017Krishna Bharat, Monika Henzinger
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic, by augmenting a previous connectivity analysis based algorithm with content analysis.
Computer NetworksFinding related pages in the World Wide Web
491 Citations1999Jay B. Dean, Monika Henzinger
This paper discusses a different approach to Web searching where the input to the search process is not a set of query terms, but instead is the URL of a page, and the output is aSet of related Web pages.
Stable algorithms for link analysis
290 Citations2001Andrew Y. Ng, Alice X. Zheng +1 more
The analysis is extended and it is shown how it gives insight into ways of designing stable link analysis methods and motivates two new algorithms, whose performance is studied empirically using citation data and web hyperlink data.
What can you do with a Web in your Pocket
139 Citations1998Sergey Brin, Rajeev Motwani +2 more
The Stanford WebBase is described, a local repository of a significant portion of the Web that has properties that are useful for search and navigation and a novel search engine called Google, which also makes heavy use of anchor text.
The structure of broad topics on the web
121 Citations2002Soumen Chakrabarti, Mukul M. Joshi +2 more
It is proposed that a topic taxonomy such as Yahoo! or the Open Directory provides a useful framework for understanding the structure of content-based clusters and communities and measurements may prove valuable in the design of community-specific crawlers and link-based ranking systems.
Lecture notes in computer sciencePROS: A Personalized Ranking Platform for Web Search
51 Citations2004Paul‐Alexandru Chirita, Daniel Olmedilla +1 more
This paper shows how to automate this hub selection process and build upon the latter algorithm to implement a platform for personalized ranking, and presents a first evaluation of this prototype of a personalized Web search system.
A generalized site ranking model for Web IR
11 Citations2004Chen Ding, Chen-Chung Chi
This work proposes a ranking model to measure the relevance of the whole Web site and takes some illustrations to show the idea and provide evidences to indicate its effectiveness.
Topic continuity for Web document categorization and ranking
11 Citations2004B.L. Narayan, C.A. Murthy +1 more
A novel algorithm is proposed that harnesses the information contained in the history of a surfer to determine the topic of interest on a given page and guess it probabilistically so that the operations can be performed offline.
Detecting near-replicas on the Web by content and hyperlink analysis
5 Citations2004Ernesto Di Iorio, Michelangelo Diligenti +3 more
This work proposes a method to detect similar pages, in particular replicas and near-replicas, which is based on a pair of signatures, and shows that on the given dataset near-Replicas can be detected with a precision-recall of 93%.