Sciweavers

11 search results - page 1 / 3
» Ranking with Query-Dependent Loss for Web Search
Sort
View
WSDM
2010
ACM
194views Data Mining» more  WSDM 2010»
14 years 2 months ago
Ranking with Query-Dependent Loss for Web Search
Queries describe the users' search intent and therefore they play an essential role in the context of ranking for information retrieval and Web search. However, most of exist...
Jiang Bian, Tie-Yan Liu, Tao Qin, Hongyuan Zha
SIGIR
2008
ACM
13 years 5 months ago
Query dependent ranking using K-nearest neighbor
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existin...
Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, H...
WWW
2011
ACM
13 years 7 days 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...
NIPS
2007
13 years 6 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
IPM
2008
100views more  IPM 2008»
13 years 5 months ago
Query-level loss functions for information retrieval
Many machine learning technologies such as support vector machines, boosting, and neural networks have been applied to the ranking problem in information retrieval. However, since...
Tao Qin, Xu-Dong Zhang, Ming-Feng Tsai, De-Sheng W...