364 search results - page 1 / 73 » Computing Communities in Large Networks Using Random Walks |
ISCIS
2005
Springer
13 years 10 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
KDD
2007
ACM
14 years 4 months ago
2007
ACM
Abstract. Extracting information from very large collections of structured, semistructured or even unstructured data can be a considerable challenge when much of the hidden informa...
MSWIM
2006
ACM
13 years 10 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
PR
2011
12 years 7 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...
ICDM
2006
IEEE
13 years 10 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...