What is this page known for? Computing Web page reputations
Computer NetworksPublished 1 June 2000
Davood Rafiei, Alberto O. Mendelzon
Citations125
SJR quartileQ1
SJR score1.17
SNIP1.37
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 search process where the input is the URL of a page, and the output is a ranked set of topics on which the page has a reputation, and several algorithmic formulations of the notion of reputation are proposed.
Abstract
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search process where the input is the URL of a page, and the output is a ranked set of topics on which the page has a reputation. For example, if the input is www.gamelan.com, then a possible output is `Java'. We propose several algorithmic formulations of the notion of reputation using simple random walk models of Web-browsing behavior. We give preliminary test results on the effectiveness of these algorithms.
Keywords
Computer Science
Computer Networks and ISDN SystemsThe anatomy of a large-scale hypertextual Web search engine
15,828 Citations1998Sergey Brin, Lawrence M. Page
This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
Symposium on Discrete AlgorithmsAuthoritative sources in a hyperlinked environment
1,836 Citations1998Jon Kleinberg
Computer NetworksTrawling the Web for emerging cyber-communities
1,010 Citations1999Ravi Kumar, Prabhakar Raghavan +2 more
The subject of this paper is the systematic enumeration of over 100,000 emerging communities from a Web crawl, motivating a graph-theoretic approach to locating such communities, and describing the algorithms and algorithmic engineering necessary to find structures that subscribe to this notion.
Enhanced hypertext categorization using hyperlinks
775 Citations1998Soumen Chakrabarti, Byron Dom +1 more
This work has developed a text classifier that misclassified only 13% of the documents in the well-known Reuters benchmark; this was comparable to the best results ever obtained and its technique also adapts gracefully to the fraction of neighboring documents having known topics.
Inferring Web communities from link topology
772 Citations1998David Gibson, Jon Kleinberg +1 more
This investigation shows that although the process by which users of the Web create pages and links is very difficult to understand at a “local” level, it results in a much greater degree of orderly high-level structure than has typically been assumed.
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.
ACM SIGMOD RecordDatabase techniques for the World-Wide Web
560 Citations1998Daniela Florescu, Alon Y. Levy +1 more
The primary goal of this survey is to classify the different tasks to which database concepts have been applied, and to emphasize the technical innovations that were required to do so.
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.
Extracting Large-Scale Knowledge Bases from the Web
232 Citations1999Ravi Kumar, Prabhakar Raghavan +2 more
This paper develops novel algorithms for enumerating and organizing all web occurrences of certain subgraphs that are signatures of web phenomena such as tightly-focused topic communities, webrings, taxonomy trees, keiretsus, etc, and argues that these algorithms run efficiently in this model.
IEEE Internet ComputingContext and page analysis for improved Web search
184 Citations1998Sandra Lawrence, C. Lee Giles
The paper discusses the features of the NECI metasearch engine and suggests ways to improve the efficiency of Web searches by downloading and analyzing each document and then displaying results that show the query terms in concert.
ACM SIGMOD RecordEnhanced hypertext categorization using hyperlinks
157 Citations1998Soumen Chakrabarti, Byron Dom +1 more
Computer NetworksMeasuring index quality using random walks on the Web
137 Citations1999Monika Henzinger, Allan Heydon +2 more
A simple, effective algorithm is provided for approximating the quality of an index by performing a random walk on the Web, and this methodology is used to compare the index quality of several major search engines.