MP
2011
13 years 6 months ago
2011
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
WAOA
2010
Springer
13 years 9 months ago
2010
Springer
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
NIPS
2008
14 years 28 days ago
2008
This paper studies global ranking problem by learning to rank methods. Conventional learning to rank methods are usually designed for `local ranking', in the sense that the r...
APWEB
2003
Springer
14 years 4 months ago
2003
Springer
Search engines are among the most important applications or services on the web. Most existing successful search engines use global ranking algorithms to generate the ranking of do...
IICS
2005
Springer
14 years 5 months ago
2005
Springer
We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated c...