180 search results - page 11 / 36 » Learning random walks to rank nodes in graphs |
WWW
2004
ACM
14 years 8 months ago
2004
ACM
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
PR
2011
12 years 10 months ago
2011
In this paper we propose a novel approach to content-based image retrieval with relevance feedback, which is based on the random walker algorithm introduced in the context of inte...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
The discovery of objects with exceptional behavior is an important challenge from a knowledge discovery standpoint and has attracted much attention recently. In this paper, we pre...
ECML
2004
Springer
14 years 27 days ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
DAGM
2004
Springer
14 years 27 days ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...