Krishna Bharat, Bay-Wei Chang, Monika Henzinger, Matthias Ruhl  Home/Search
Context Related
| mit.edu/~ruhl/papers/2001icdm.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~ruhl/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Previous studies of the web graph structure have focused on the graph structure at the level of individual pages. In actuality the web is a hierarchically nested graph, with domains, hosts and web sites introducing intermediate levels of affiliation and administrative control. To better understand the growth of the web we need to understand its macro-structure, in terms of the linkage between web sites. In this paper we approximate this by studying the graph of the linkage between hosts on the... (Update)
Similar documents based on text: More All
0.3: Query-Free News Search - Henzinger, Chang, Milch, Brin (2003) (Correct)
0.3: A Comparison of Techniques to Find Mirrored Hosts on the WWW - Bharat, Broder, Dean, al. (1999) (Correct)
0.3: Web Information Retrieval - an Algorithmic Perspective - Henzinger (2000) (Correct)
Related documents from co-citation: More All
9: Graph structure in the Web (context) - Broder, Kumar et al. - 2000
8: The PageRank citation ranking: Bringing order to the Web - Page, Brin et al.
7: Extrapolation methods for accelerating PageRank computations - Kamvar, Haveliwala et al. - 2003
BibTeX entry: (Update)
Krishna Bharat, Bay-Wei Chang, Monika Henzinger, and Matthias Ruhl. Who links to whom: Mining linkage between web sites. In IEEE International Conference on Data Mining (ICDM '01), San Jose, California, November 2001. http://citeseer.ist.psu.edu/bharat03who.html More
@inproceedings{ bharat01who,
author = "Krishna Bharat and Bay-Wei Chang and Monika Rauch Henzinger and Matthias Ruhl",
title = "Who Links to Whom: Mining Linkage between Web Sites",
booktitle = "{ICDM}",
pages = "51-58",
year = "2001",
url = "citeseer.ist.psu.edu/bharat03who.html" }
Citations (may not include all citations):225 Emergence of scaling in random networks (context) - Barabasi, Albert - 1999
177 Rate of change and other metrics: a live study of the world .. - Douglis, Feldmann et al. - 1997
140 Graph structure in the web (context) - Broder, Kumar et al. - 2000
126 Diameter of the world wide web (context) - Albert, Jeong et al. - 1999
114 Silk from a sow's ear: Extracting usable structure from the .. - Pirolli, Pitkow et al. - 1996
82 Finding related pages in the world wide web - Dean, Henzinger - 1999
72 The web as a graph: Measurements (context) - Kleinberg, Kumar et al. - 1999
71 The evolution of the web and implications for an incremental.. - Cho, Garcia-Molina - 2000
59 Stochastic models for the web graph - Kumar, Raghavan et al. - 2000
55 How dynamic is the web - Brewington, Cybenko - 2000
39 Towards a better understanding of web resources and server r.. - Wills, Mikhailov - 1999
37 and lawfulness on the electronic frontier (context) - Pitkow, Pirolli et al. - 1997
30 Identifying aggregates in hypertext structures - Botafogo, Shneiderman - 1991
19 A comparison of techniques to find mirrored hosts on the www - Bharat, Broder et al. - 2000
16 Evolutionary dynamics of the world wide web (context) - Adamic, Huberman - 1999
9 Discovery and retrieval of logical information units in web - Tajima, Hatano et al. - 1999
7 Constructing multigranular and topic-focused web site maps (context) - Li, Ayan et al. - 2001
4 Scaling behavior on the world wide web (context) - Adamic, Huberman - 1999
4 Trawling the web for cyber communities (context) - Kumar, Raghavan et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://toc.lcs.mit.edu/~ruhl/papers/): More
Counting and Addition cannot express Deterministic Transitive.. - Ruhl (1999) (Correct)
Adaptive Partitionings for Fractal Image Compression - Ruhl, Hartenstein, Saupe (1997) (Correct)
The Directed Steiner Network problem is tractable for a.. - Feldman, Ruhl (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC