When experts agree

Published 1 April 2001

Krishna Bharat, George A. Mihaila

DOI10.1145/371920.372162

Citations43

TL;DR

This paper proposes a novel ranking scheme for popular topics that places the most authoritative pages on the query topic at the top of the ranking, and presents a prototype search engine that implements the scheme and discusses its performance.

Abstract

Article Share on When experts agree: using non-affiliated experts to rank popular topics Authors: Krishna Bharat Google Inc., 2400 Bayshore Parkway, Mountain View and Compaq, Systems Research Center, Palo Alto Google Inc., 2400 Bayshore Parkway, Mountain View and Compaq, Systems Research Center, Palo AltoView Profile , George A. Mihaila I.B.M. T.J. Watson Research, Center, 30 Saw Mill River Road, Hawthorne, NY and Department of Computer Science, University of Toronto I.B.M. T.J. Watson Research, Center, 30 Saw Mill River Road, Hawthorne, NY and Department of Computer Science, University of TorontoView Profile Authors Info & Claims WWW '01: Proceedings of the 10th international conference on World Wide WebMay 2001 Pages 597–602https://doi.org/10.1145/371920.372162Online:01 April 2001Publication History 20citation425DownloadsMetricsTotal Citations20Total Downloads425Last 12 Months8Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Keywords

Computer SciencePhysics and Astronomy

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.

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.

View PDF

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.

Computer Networks and ISDN SystemsAutomatic resource compilation by analyzing hyperlink structure and associated text

700 Citations1998Soumen Chakrabarti, Byron Dom +4 more

An evaluation of ARC suggests that the resources found by ARC frequently fare almost as well as, and sometimes better than, lists of resources that are manually compiled or classified into a topic.

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 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.

View PDF

Improved algorithms for topic distillation in a hyperlinked environment

439 Citations1998Krishna Bharat, Monika Henzinger

View PDF