2100 search results - page 289 / 420 » Learning to rank on graphs |
192
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
160
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
282
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
167
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...
197
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference f...