Sciweavers

WAW
2009
Springer
138views Algorithms» more  WAW 2009»
14 years 6 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
14 years 6 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
14 years 12 months ago
A framework for community identification in dynamic social networks
We propose frameworks and algorithms for identifying communities in social networks that change over time. Communities are intuitively characterized as "unusually densely kni...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf, D...
WWW
2003
ACM
15 years 7 days ago
On the bursty evolution of blogspace
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, And...