2100 search results - page 18 / 420 » Learning to rank on graphs |
82
Voted
COLT
2010
Springer
14 years 7 months ago
2010
Springer
ITA
2006
14 years 9 months ago
2006
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
SIAMDM
2008
14 years 9 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
89
Voted
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
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 ...
113
click to vote
VLDB
2007
ACM
15 years 3 months ago
2007
ACM
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...