Sciweavers

2100 search results - page 31 / 420
» Learning to rank on graphs
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Learning to rank using gradient descent
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these...
Christopher J. C. Burges, Tal Shaked, Erin Renshaw...
WWW
2007
ACM
15 years 10 months ago
On ranking techniques for desktop search
This paper addresses the desktop search problem by considering various techniques for ranking results of a search query over the file system. First, basic ranking techniques, whic...
Sara Cohen, Carmel Domshlak, Naama Zwerdling
ICCBR
2007
Springer
15 years 3 months ago
Label Ranking in Case-Based Reasoning
The problem of label ranking has recently been introduced as an extension of conventional classification in the field of machine learning. In this paper, we argue that label ran...
Klaus Brinker, Eyke Hüllermeier
87
Voted
WEBI
2005
Springer
15 years 3 months ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...
CIKM
2000
Springer
15 years 2 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...