11 search results - page 1 / 3 » Learnability of Bipartite Ranking Functions |
COLT
2005
Springer
13 years 10 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
SIGIR
2008
ACM
13 years 4 months ago
2008
ACM
CORR
2012
Springer
12 years 17 days ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...