Sciweavers

243 search results - page 2 / 49
» Empirical comparison of algorithms for network community det...
Sort
View
WWW
2010
ACM
13 years 11 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf
INFOSCALE
2006
ACM
13 years 10 months ago
Analysis and comparison of P2P search methods
The popularity and bandwidth consumption attributed to current Peer-to-Peer file-sharing applications makes the operation of these distributed systems very important for the Inte...
Dimitrios Tsoumakos, Nick Roussopoulos
AUSDM
2008
Springer
237views Data Mining» more  AUSDM 2008»
13 years 6 months ago
On Inconsistencies in Quantifying Strength of Community Structures
Complex network analysis involves the study of the properties of various real world networks. In this broad field, research on community structures forms an important sub area. Th...
Wen Haw Chong
INFOCOM
2011
IEEE
12 years 8 months ago
Adaptive algorithms for detecting community structure in dynamic social networks
—Social networks exhibit a very special property: community structure. Understanding the network community structure is of great advantages. It not only provides helpful informat...
Nam P. Nguyen, Thang N. Dinh, Ying Xuan, My T. Tha...
WIOPT
2010
IEEE
13 years 3 months ago
Static community detection algorithms for evolving networks
—Complex networks can often be divided in dense sub-networks called communities. Using a partition edit distance, we study how three community detection algorithms transform thei...
Thomas Aynaud, Jean-Loup Guillaume