Sciweavers

4553 search results - page 81 / 911
» Distributed Ranked Search
Sort
View
WWW
2009
ACM
16 years 2 months ago
Estimating the impressionrank of web pages
The ImpressionRank of a web page (or, more generally, of a web site) is the number of times users viewed the page while browsing search results. ImpressionRank captures the visibi...
Ziv Bar-Yossef, Maxim Gurevich
SIGIR
2009
ACM
15 years 8 months ago
Portfolio theory of information retrieval
This paper studies document ranking under uncertainty. It is tackled in a general situation where the relevance predictions of individual documents have uncertainty, and are depen...
Jun Wang, Jianhan Zhu
123
Voted
ALT
2008
Springer
15 years 11 months ago
Smooth Boosting for Margin-Based Ranking
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masa...
WWW
2001
ACM
16 years 2 months ago
When experts agree: using non-affiliated experts to rank popular topics
In response to a query a search engine returns a ranked list of documents. If the query is on a popular topic (i.e., it matches many documents) then the returned list is usually t...
Krishna Bharat, George A. Mihaila
193
Voted
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 2 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang