Sciweavers

155 search results - page 12 / 31
» On learning linear ranking functions for beam search
Sort
View
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 8 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
MP
2011
13 years 2 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
EMNLP
2009
13 years 5 months ago
Empirical Exploitation of Click Data for Task Specific Ranking
There have been increasing needs for task specific rankings in web search such as rankings for specific query segments like long queries, time-sensitive queries, navigational quer...
Anlei Dong, Yi Chang, Shihao Ji, Ciya Liao, Xin Li...
CIKM
2010
Springer
13 years 6 months ago
Learning to rank relevant and novel documents through user feedback
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
Abhimanyu Lad, Yiming Yang
SIGIR
2011
ACM
12 years 10 months ago
Parallel learning to rank for information retrieval
Learning to rank represents a category of effective ranking methods for information retrieval. While the primary concern of existing research has been accuracy, learning efficien...
Shuaiqiang Wang, Byron J. Gao, Ke Wang, Hady Wiraw...