Sciweavers

9 search results - page 1 / 2
» Extracting dense communities from telecom call graphs
Sort
View
COMSWARE
2008
IEEE
13 years 6 months ago
Extracting dense communities from telecom call graphs
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea,...
TAMC
2010
Springer
13 years 9 months ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft
IPPS
2008
IEEE
13 years 11 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
ASUNAM
2010
IEEE
13 years 4 months ago
Product Adoption Networks and Their Growth in a Large Mobile Phone Network
—To understand the diffusive spreading of a product in a telecom network, whether the product is a service, handset, or subscription, it can be very useful to study the structure...
Pal Roe Sundsoy, Johannes Bjelland, Geoffrey Canri...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 4 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...