Sciweavers

733 search results - page 17 / 147
» Recommending random walks
Sort
View
SODA
2010
ACM
142views Algorithms» more  SODA 2010»
14 years 8 months ago
Speeding up random walks with neighborhood exploration
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
Petra Berenbrink, Colin Cooper, Robert Elsaesser, ...
MIR
2005
ACM
140views Multimedia» more  MIR 2005»
15 years 3 months ago
Multiple random walk and its application in content-based image retrieval
In this paper, we propose a transductive learning method for content-based image retrieval: Multiple Random Walk (MRW). Its basic idea is to construct two generative models by mea...
Jingrui He, Hanghang Tong, Mingjing Li, Wei-Ying M...
91
Voted
ICML
2007
IEEE
15 years 10 months ago
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
Arik Azran
AIPS
2004
14 years 11 months ago
Learning Domain-Specific Control Knowledge from Random Walks
We describe and evaluate a system for learning domainspecific control knowledge. In particular, given a planning domain, the goal is to output a control policy that performs well ...
Alan Fern, Sung Wook Yoon, Robert Givan
101
Voted
CVPR
2009
IEEE
15 years 4 months ago
Random walks on graphs to model saliency in images
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...
Viswanath Gopalakrishnan, Yiqun Hu, Deepu Rajan