Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Robert E. Adams

dblp:404/6563 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
ranking
0.112005
Page Quality: In Search of an Unbiased Web Ranking · SIGMOD Conference 2005
Information retrieval
retrieval models
0.112005
Page Quality: In Search of an Unbiased Web Ranking · SIGMOD Conference 2005
Information retrieval › search engines
search engine bias
0.112005
Page Quality: In Search of an Unbiased Web Ranking · SIGMOD Conference 2005
Information retrieval › ranking › search ranking
web ranking
0.112005
Page Quality: In Search of an Unbiased Web Ranking · SIGMOD Conference 2005

Methods — techniques the papers use, named apart from their topics

web user modeling · 0.1quality estimation · 0.1
YearPublicationVenuePosition
2005 Page Quality: In Search of an Unbiased Web Ranking
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-quality pages get the attention that they deserve.
Junghoo Cho, Sourashis Roy, Robert E. Adams
SIGMOD Conference3