CoChat
Sign Up
Cited by 69

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Page quality: in search of an unbiased web ranking

Cho, Junghoo, Roy, Sourashis, Adams, Robert E.·2005·Proceedings of the 2005 ACM SIGMOD international conference on Management of data
DOI 10.1145/1066157.1066220
Open this paper in CoChat — free account

Abstract

In a number of recent studies [4, 8] researchers have found that because search engines repeatedly return currently popular pages at the top of search results, popular pages tend to get even more popular, while unpopular pages get ignored by an average user. This "rich-get-richer" phenomenon is particularly problematic for new and high-quality pages because they may never get a chance to get users' attention, decreasing the overall quality of search results in the long run. In this paper, we propose a new ranking function, called page quality that can alleviate the problem of popularity-based ranking. We first present a formal framework to study the search engine bias by discussing what is an "ideal" way to measure the intrinsic quality of a page. We then compare how PageRank, the current ranking metric used by major search engines, differs from this ideal quality metric. This framework will help us investigate the search engine bias in more concrete terms and provide clear understanding why PageRank is effective in many cases and exactly when it is problematic. We then propose a practical way to estimate the intrinsic page quality to avoid the inherent bias of PageRank. We derive our proposed quality estimator through a careful analysis of a reasonable web user model, and we present experimental results that show the potential of our proposed estimator. We believe that our quality estimator has the potential to alleviate the rich-get-richer phenomenon and help new and high-q…

Overview

Integrity signals

Registry

Crossref · 10.1145/1066157.1066220

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 1 references

Research works printed but not linked: 29

  1. 10.1145/775152.775192 · DOI
  2. 10.5555/874063.875586 · DOI
  3. Albert R., 1999, Diameter of the World Wide Web. Nature, 401, 130
  4. Baeza-Yates R., 2002, Proceedings of SPIRE 2002
  5. Balmin A., 2004, Proceedings of the International Conference on Very Large Databases (VLDB)
  6. 10.1126/science.286.5439.509 · DOI · Paper page
  7. Broder A., 2000, Proceedings of the International World-Wide Web Conference
  8. 10.1145/988672.988676 · DOI
  9. Cho J., 2005, UCLA Computer Science
  10. 10.1093/comjnl/35.3.243 · DOI
  11. 10.5555/1316689.1316738 · DOI
  12. Goldman R., 1998, Proceedings of the International Conference on Very Large Databases (VLDB), 26
  13. 10.1002/(SICI)1097-4571(199601)47:1%3C37::AID-ASI4%3E3.3.CO;2-I · DOI
  14. Kamvar S., 2003, Proceedings of International Conference on the Numerical Solution of Markov Chains.
  15. 10.1145/775152.775190 · DOI
  16. 10.1145/324133.324140 · DOI
  17. 10.14236/ewic/MIRA1999.5 · DOI
  18. Npd search and portal site study. Available at http: / /www.npd.com/press/releases/press_000919.htm. Npd search and portal site study. Available at http: / /www.npd.com/press/releases/press_000919.htm.
  19. Page L., 1999, Stanford University Database Group, 1998
  20. 10.1073/pnas.032085699 · DOI
  21. 10.1002/asi.4630270302 · DOI
  22. G. Salton. The SMART Retrieval System -- Experiments in Automatic Document Processing. Prentice Hall Inc. 1971. G. Salton. The SMART Retrieval System -- Experiments in Automatic Document Processing. Prentice Hall Inc. 1971.
  23. Salton G., 1983, McGraw-Hill
  24. 10.1145/775152.775202 · DOI
  25. TREC : Text retrieval conference. http://trec.nist.gov. TREC: Text retrieval conference. http://trec.nist.gov.
  26. 10.1145/775152.775203 · DOI
  27. F. Verhulst. Nonlinear Differential Equations and Dynamical Systems Springer Verlag 2nd edition 1997. F. Verhulst. Nonlinear Differential Equations and Dynamical Systems Springer Verlag 2nd edition 1997. · DOI
  28. 10.5555/1316689.1316727 · DOI
  29. Wartick S., 1992, Information Retrieval: Data Structures and Algorithms, 264

Cited by

Sorted by citations

Metadata

Authors
Cho, J., Roy, S., & Adams, R. E.
Affiliations
UCLA Computer Science
Venue
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Publisher
ACM
Published
2005-06-14
Pages
551-562
DOI
10.1145/1066157.1066220
Cited by
69
References
1
Licence
www.acm.org/publications/policies/copyright_policy#Background (vor)

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