Sciweavers

2100 search results - page 18 / 420
» Learning to rank on graphs
Sort
View
108
Voted
COLT
2010
Springer
14 years 12 months ago
Ranking with Kernels in Fourier space
Risi Imre Kondor, Marconi S. Barbosa
ITA
2006
163views Communications» more  ITA 2006»
15 years 1 months ago
Graph fibrations, graph isomorphism, and PageRank
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...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
SIAMDM
2008
115views more  SIAMDM 2008»
15 years 1 months ago
Rank-Width and Well-Quasi-Ordering
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...
Sang-il Oum
CIKM
2009
Springer
15 years 8 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
154
Voted
VLDB
2007
ACM
229views Database» more  VLDB 2007»
15 years 8 months ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
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...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...