180 search results - page 15 / 36 » Learning random walks to rank nodes in graphs |
JMLR
2006
13 years 7 months ago
2006
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
ICIP
2009
IEEE
14 years 5 months ago
2009
IEEE
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...
BMVC
2001
13 years 10 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
AAAI
2011
12 years 7 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...