Sciweavers

367 search results - page 13 / 74
» CT-Rank: A Time-aware Ranking Algorithm for Web Search
Sort
View
WWW
2011
ACM
14 years 4 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
HT
2011
ACM
14 years 1 months ago
Bridging link and query intent to enhance web search
Understanding query intent is essential to generating appropriate rankings for users. Existing methods have provided customized rankings to answer queries with different intent. W...
Na Dai, Xiaoguang Qi, Brian D. Davison
81
Voted
SIGIR
2009
ACM
15 years 4 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
WSDM
2010
ACM
210views Data Mining» more  WSDM 2010»
15 years 7 months ago
Towards Recency Ranking in Web Search
In web search, recency ranking refers to ranking documents by relevance which takes freshness into account. In this paper, we propose a retrieval system which automatically detect...
Anlei Dong, Yi Chang, Zhaohui Zheng, Gilad Mishne,...
WEBI
2010
Springer
14 years 7 months ago
Lightweight Clustering Methods for Webspam Demotion
Abstract--To make sure they can quickly respond to a specific query, the main search engines have several mechanisms. One of them consists in ranking web pages according to their i...
Thomas Largillier, Sylvain Peyronnet