30 search results - page 3 / 6 » An improved algorithm for finding community structure in net... |
KDD
2007
ACM
14 years 6 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
AIIA
2003
Springer
13 years 10 months ago
2003
Springer
A bayesian network is an appropriate tool for working with uncertainty and probability, that are typical of real-life applications. In literature we find different approaches for b...
WWW
2008
ACM
14 years 6 months ago
2008
ACM
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...
KDD
2007
ACM
14 years 6 months ago
2007
ACM
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
INFOCOM
2007
IEEE
13 years 12 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...