Sciweavers

155 search results - page 6 / 31
» On learning linear ranking functions for beam search
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Learning to rank from Bayesian decision inference
Ranking is a key problem in many information retrieval (IR) applications, such as document retrieval and collaborative filtering. In this paper, we address the issue of learning ...
Jen-Wei Kuo, Pu-Jen Cheng, Hsin-Min Wang
WWW
2011
ACM
13 years 2 months ago
Learning to rank with multiple objective functions
We investigate the problem of learning to rank for document retrieval from the perspective of learning with multiple objective functions. We present solutions to two open problems...
Krysta Marie Svore, Maksims Volkovs, Christopher J...
IJCNN
2006
IEEE
14 years 1 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
CIKM
2008
Springer
13 years 9 months ago
Are click-through data adequate for learning web search rankings?
Learning-to-rank algorithms, which can automatically adapt ranking functions in web search, require a large volume of training data. A traditional way of generating training examp...
Zhicheng Dou, Ruihua Song, Xiaojie Yuan, Ji-Rong W...
CIKM
2009
Springer
14 years 2 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles