The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Weighted PageRank algorithm
Abstract
With the rapid growth of the Web, users easily get lost in the rich hyper structure. Providing the relevant information to users to cater to their needs is the primary goal of Website owners. Therefore, finding the content of the Web and retrieving the users' interests and needs from their behavior have become increasingly important. Web mining is used to categorize users and pages by analyzing user behavior, the content of the pages, and the order of the URLs that tend to be accessed. Web structure mining plays an important role in this approach. Two page ranking algorithms, HITS and PageRank, are commonly used in Web structure mining. Both algorithms treat all links equally when distributing rank scores. Several algorithms have been developed to improve the performance of these methods. The weighted PageRank algorithm (WPR), an extension to the standard PageRank algorithm, is introduced. WPR takes into account the importance of both the inlinks and the outlinks of the pages and distributes rank scores based on the popularity of the pages. The results of our simulation studies show that WPR performs better than the conventional PageRank algorithm in terms of returning a larger number of relevant pages to a given query.
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
Cited by
Page Ranking Algorithms: A Survey
Duhan, N., Sharma, A. K., & Bhatia, K. K. (2009) · 2009 IEEE International Advance Computing Conference · doi:10.1109/iadcc.2009.4809246 · Cited by 150
Yu, G., Chen, P., Chen, H., Guan, Z., Huang, Z., Jing, L., Weng, T., Sun, X., & Li, X. (2021) · Proceedings of the Web Conference 2021 · doi:10.1145/3442381.3449905 · Cited by 158
Tang, J., & Liu, H. (2015) · Synthesis Lectures on Information Security, Privacy, and Trust · doi:10.2200/s00657ed1v01y201507spt013 · Cited by 53
Gao, Y., Xu, A., Hu, P. J.-H., & Cheng, T.-H. (2017) · Decision Support Systems · doi:10.1016/j.dss.2017.01.007 · Cited by 26
Metadata
- Authors
- Xing, W., & Ghorbani, A.
- Venue
- Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004.
- Publisher
- IEEE
- Published
- 2004
- Pages
- 305-314
- OpenAlex
- W2090018148
- Cited by
- 572
- References
- 1
- FWCI
- 3.69
- 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: Weighted PageRank algorithm. https://app.cochat.ai/papers/10.1109/dnsr.2004.1344743
- The paper
- Xing, W., & Ghorbani, A. (2004). Weighted PageRank algorithm. Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004. https://doi.org/10.1109/dnsr.2004.1344743
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.
