767 search results - page 19 / 154 » On Clustering Using Random Walks |
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
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...
SIAMDM
2010
13 years 3 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...