Topical interests and the mitigation of search engine bias
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Search engines have become key media for our scientific, economic, and social activities by enabling people to access information on the web despite its size and complexity. On the down side, search engines bias the traffic of users according to their page ranking strategies, and it has been argued that they create a vicious cycle that amplifies the dominance of established and already popular sites. This bias could lead to a dangerous monopoly of information. We show that, contrary to intuition, empirical data do not support this conclusion; popular sites receive far less traffic than predicted. We discuss a model that accurately predicts traffic data patterns by taking into consideration the topical interests of users and their searching behavior in addition to the way search engines rank pages. The heterogeneity of user interests explains the observed mitigation of search engines’ popularity bias.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 1×
“est of the scientific community. The topology of the Web as a complex, scale-free network is Copyright is held by the author/owner(s). WWW2006, May 22–26, 2006, Edinburgh, UK. . now well characterized [2, 16, 8, 1, 17]. Several growth and navigation models have been proposed to explain the Web’s emergent topological ch…”
BackgroundUsing PageRank to Characterize Web Structure
Pandurangan, G., Raghavan, P., & Upfal, E. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45655-4_36 · Cited by 164
Cited by
I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system
Cha, M., Kwak, H., Rodriguez, P., Ahn, Y.-Y., & Moon, S. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298309 · Cited by 1,576
The Ambivalent Ontology of Digital Artifacts1
Kallinikos, J., Aaltonen, A., & Marton, A. (2013) · MIS Quarterly · doi:10.25300/misq/2013/37.2.02 · Cited by 780
Random walks and diffusion on networks
Masuda, N., Porter, M. A., & Lambiotte, R. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.07.007 · Cited by 657
Analyzing the Video Popularity Characteristics of Large-Scale User Generated Content Systems
Cha, M., Kwak, H., Rodriguez, P., Ahn, Y.-Y., & Moon, S. (2009) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.2011358 · Cited by 485
Kitchens, B., Johnson, S. L., & Gray, P. (2020) · MIS Quarterly · doi:10.25300/misq/2020/16371 · Cited by 376
Metadata
- Authors
- Fortunato, S., Flammini, A., Menczer, F., & Vespignani, A.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2006-08-22
- Volume
- 103
- Issue
- 34
- Pages
- 12684-12689
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2165925342
- Cited by
- 138
- References
- 3
- FWCI
- 28.92
- Type
- journal article
- 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: Topical interests and the mitigation of search engine bias. https://app.cochat.ai/papers/10.1073/pnas.0605525103
- The paper
- Fortunato, S., Flammini, A., Menczer, F., & Vespignani, A. (2006). Topical interests and the mitigation of search engine bias. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.0605525103
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.