The DOI matches its Crossref record.
Who links to whom: mining linkage between Web sites
Open accessAbstract
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. We approximate this by studying the graph of the linkage between hosts on the Web. This was done based on snapshots of the Web taken by Google in Oct 1999, Aug 2000 and Jun 2001. The connectivity between hosts is represented by a directed graph, with hosts as nodes and weighted edges representing the count of hyperlinks between pages on the corresponding hosts. We demonstrate how such a "hostgraph" can be used to study connectivity properties of hosts and domains over time, and discuss a modified "copy model" to explain observed link weight distributions as a function of subgraph size. We discuss changes in the Web over time in the size and connectivity of Web sites and country domains. We also describe a data mining application of the hostgraph: a related host finding algorithm which achieves a precision of 0.65 at rank 3.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 19
- 10.1016/S1389-1286(99)00022-5 · DOI · Paper page
- douglis, 1997, Rate of change and other metrics: a live study of the world wide web, Proc USENIX Symposium on Internet Technologies and Systems
- kleinberg, 1999, The web as a graph: Measurements, models, and methods, Proc ICCC
- 10.1109/SFCS.2000.892065 · DOI · Paper page
- kumar, 1999, Trawling the web for cyber communities, Proc 8th WWW Conf
- li, 2001, Constructing multigranular and topic-focused web site maps, Proc 10th WWW Conf
- 10.1145/238386.238450 · DOI · Paper page
- pitkow, 1997, Life, death, and lawfulness on the electronic frontier, Proc ACM SIGchi
- tajima, 1999, Discovery and retrieval of logical information units in web (invited paper), ACM Digital Library Workshop on Organizing Web Space (WOWS)
- 10.1016/S1389-1286(99)00037-7 · DOI
- barabasi, 1999, Emergence of scaling in random networks, Science, 286, 509, 10.1126/science.286.5439.509 · DOI · Paper page
- albert, 1999, Diameter of the world wide web, Nature, 401, 130, 10.1038/43601 · DOI · Paper page
- 10.1145/122974.122981 · DOI
- 10.1002/1097-4571(2000)9999:9999<::AID-ASI1025>3.0.CO;2-0 · doi:10.1002/1097-4571(2000)9999:9999<::aid-asi1025>3.0.co;2-0
- 10.1016/S1389-1286(00)00083-9 · DOI · Paper page
- 10.1016/S1389-1286(00)00045-1 · DOI · Paper page
- adamic, 1999, Scaling behavior on the world wide web, Science, 286
- 10.1038/43604 · DOI · Paper page
- cho, 2000, The evolution of the web and implications for an incremental crawler, VLDB
Cited by
On the bursty evolution of blogspace
Kumar, R., Novak, J., Raghavan, P., & Tomkins, A. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775233 · Cited by 553
(2003) · Cited by 312
Spam, damn spam, and statistics: using statistical analysis to locate spam web pages
Fetterly, D., Manasse, M., & Najork, M. (2004) · Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004 · doi:10.1145/1017074.1017077 · Cited by 291
Search engine coverage bias: evidence and possible causes
Vaughan, L., & Thelwall, M. (2004) · Information Processing & Management · doi:10.1016/s0306-4573(03)00063-3 · Cited by 259
Algorithmic Challenges in Web Search Engines
Henzinger, M. R. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129079 · Cited by 81
Self-citation
Metadata
- Authors
- Bharat, K., Chang, B.-W., Henzinger, M., & Ruhl, M.
- Venue
- Proceedings 2001 IEEE International Conference on Data Mining
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-14
- Pages
- 51-58
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2144982204
- Cited by
- 166
- References
- 0
- FWCI
- 34.87
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Who links to whom: mining linkage between Web sites. https://app.cochat.ai/papers/10.1109/icdm.2001.989500
- The paper
- Bharat, K., Chang, B.-W., Henzinger, M., & Ruhl, M. (2002). Who links to whom: mining linkage between Web sites. Proceedings 2001 IEEE International Conference on Data Mining. https://doi.org/10.1109/icdm.2001.989500
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.