4972 search results - page 71 / 995 » Ranking on graph data |
APWEB
2010
Springer
15 years 2 days ago
2010
Springer
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
EUROPAR
2004
Springer
15 years 5 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
ICML
2005
IEEE
16 years 20 days ago
2005
IEEE
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...
108
click to vote
ALT
2008
Springer
15 years 8 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
101
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion...