Sciweavers

767 search results - page 4 / 154
» On Clustering Using Random Walks
Sort
View
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 1 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...
SASO
2007
IEEE
14 years 1 months ago
Improving ICE Service Selection in a P2P System using the Gradient Topology
Internet Connectivity Establishment (ICE) is becoming increasingly important for P2P systems on the open Internet, as it enables NAT-bound peers to provide accessible services. A ...
Jim Dowling, Jan Sacha, Seif Haridi
AAAI
2008
13 years 9 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 7 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...