Sciweavers

344 search results - page 3 / 69
» Random Walks on Colored Graphs
Sort
View
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 2 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
11 years 10 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 2 months ago
Random Walk on Directed Dynamic Graphs
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
Oksana Denysyuk, Luis Rodrigues
INFOCOM
2012
IEEE
11 years 10 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
ECCV
2010
Springer
14 years 29 days ago
Reweighted Random Walks for Graph Matching
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
Minsu Cho (Seoul National University), Jungmin Lee...