The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Block-level link analysis
Abstract
Link Analysis has shown great potential in improving the performance of web search. PageRank and HITS are two of the most popular algorithms. Most of the existing link analysis algorithms treat a web page as a single node in the web graph. However, in most cases, a web page contains multiple semantics and hence the web page might not be considered as the atomic node. In this paper, the web page is partitioned into blocks using the vision-based page segmentation algorithm. By extracting the page-to-block, block-to-page relationships from link structure and page layout analysis, we can construct a semantic graph over the WWW such that each node exactly represents a single semantic topic. This graph can better describe the semantic structure of the web. Based on block-level link analysis, we proposed two new algorithms, Block Level PageRank and Block Level HITS, whose performances we study extensively using web data.
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
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Cited by
Recommendation systems: Principles, methods and evaluation
Isinkaye, F. O., Folajimi, Y. O., & Ojokoh, B. A. (2015) · Egyptian Informatics Journal · doi:10.1016/j.eij.2015.06.005 · Cited by 1,326
A literature review and classification of recommender systems research
Park, D. H., Kim, H. K., Choi, I. Y., & Kim, J. K. (2012) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.02.038 · Cited by 662
Automatically documenting program changes
Buse, R. P. L., & Weimer, W. R. (2010) · Proceedings of the IEEE/ACM international conference on Automated software engineering · doi:10.1145/1858996.1859005 · Cited by 219
Freshness matters: in flowers, food, and web authority
Dai, N., & Davison, B. D. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835471 · Cited by 36
Metadata
- Authors
- Cai, D., He, X., Wen, J.-R., & Ma, W.-Y.
- Venue
- Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2004-07-25
- Pages
- 440-447
- OpenAlex
- W2140204390
- Cited by
- 172
- References
- 2
- FWCI
- 11.80
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Block-level link analysis. https://app.cochat.ai/papers/10.1145/1008992.1009068
- The paper
- Cai, D., He, X., Wen, J.-R., & Ma, W.-Y. (2004). Block-level link analysis. Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval. https://doi.org/10.1145/1008992.1009068
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.