Sciweavers

Share
364 search results - page 1 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
ISCIS
2005
Springer
10 years 8 months ago
Computing Communities in Large Networks Using Random Walks
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...
Pascal Pons, Matthieu Latapy
KDD
2007
ACM
143views Data Mining» more  KDD 2007»
11 years 3 months ago
Mining Research Communities in Bibliographical Data
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...
Osmar R. Zaïane, Jiyang Chen, Randy Goebel
MSWIM
2006
ACM
10 years 8 months ago
The power of choice in random walks: an empirical study
In recent years diļ¬€erent authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
PR
2011
9 years 5 months ago
Content-based image retrieval with relevance feedback using random walks
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...
Samuel Rota Bulò, Massimo Rabbi, Marcello P...
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
10 years 8 months ago
Fast Random Walk with Restart and Its Applications
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...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
books