Web page scoring systems for horizontal and vertical search
Published 7 May 2002
Michelangelo Diligenti, Marco Gori, Marco Maggini
Citations55
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
A general framework for Web Page Scoring Systems (WPSS) is proposed which incorporates and extends many of the relevant models proposed in the literature and experimental results are given to assess the features of the proposed scoring systems with special emphasis on vertical search.
Abstract
Page ranking is a fundamental step towards the construction of effective search engines for both generic (horizontal) and focused (vertical) search. Ranking schemes for horizontal search like the PageRank algorithm used by Google operate on the topology of the graph, regardless of the page content. On the other hand, the recent development of vertical portals (vortals) makes it useful to adopt scoring systems focussed on the topic and taking the page content into account.In this paper, we propose a general framework for Web Page Scoring Systems (WPSS) which incorporates and extends many of the relevant models proposed in the literature. Finally, experimental results are given to assess the features of the proposed scoring systems with special emphasis on vertical search.
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.
Symposium on Discrete AlgorithmsAuthoritative sources in a hyperlinked environment
1,836 Citations1998Jon Kleinberg
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.
Focused Crawling Using Context Graphs
521 Citations2000Michelangelo Diligenti, Frans Coetzee +3 more
A focused crawling algorithm is presented that builds a model for the context within which topically relevant pages occur on the web that can capture typical link hierarchies within which valuable pages occur, as well as model content on documents that frequently cooccur with relevant pages.
Computer NetworksThe stochastic approach for link-structure analysis (SALSA) and the TKC effect
480 Citations2000Ronny Lempel, Shlomo Moran
SALSA, a new stochastic approach for link structure analysis, which examines random walks on graphs derived from the link structure, is presented and it is proved that SALSA is equivalent to a weighted in-degree analysis of the link-structure of World Wide Web subgraphs, making it computationally more efficient than the mutual reinforcement approach.
Improved algorithms for topic distillation in a hyperlinked environment
439 Citations1998Krishna 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.
The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity
439 Citations2000David Cohn, Thomas Hofmann
A joint probabilistic model for modeling the contents and inter-connectivity of document collections such as sets of web pages or research paper archives is described, based on a Probabilistic factor decomposition.
ACM Transactions on Information SystemsSALSA
359 Citations2001Ronny Lempel, Shlomo Moran
It is proved that SALSA is quivalent to a weighted in degree analysis of the link-sturcutre of WWW subgraphs, making it computationally more efficient than the Mutual reinforcement approach, and comparisions reveal a topological Phenomenon called the TKC effect which prevents the Mutual Reinforcement approach from identifying meaningful authorities.
Learning to Probabilistically Identify Authoritative Documents
252 Citations2000David Cohn, Huan Chang
A model of document citation that learns to identify hubs and authorities in a set of linked documents, such as pages retrieved from the world wide web, or papers retrieved from a research paper archive, provides probabilistic estimates that have clear semantics.
Does “authority” mean quality? predicting expert quality ratings of Web documents
227 Citations2000Brian Amento, Loren Terveen +1 more
An experimental evaluation of link analysis algorithms for their potential to identify high quality items using a dataset of web documents rated for quality by human topic experts found link-based metrics did a good job of picking out high-quality items.
IEEE Internet ComputingHyperlink analysis for the Web
210 Citations2001Monika Henzinger
The article discusses how hyperlink analysis can be applied to ranking algorithms, and surveys other ways Web search engines can use this analysis.
Enhanced topic distillation using text, markup tags, and hyperlinks
126 Citations2001Soumen Chakrabarti, Mukul M. Joshi +1 more
An enhanced topic distillation algorithm is presented which analyzes text, the markup tag trees that constitute HTML pages, and hyperlinks between pages and identifies subtrees which have high text- and hyperlink-based coherence w.r.t. the query.