91 search results - page 1 / 19 » Finding Overlapping Communities in Social Networks |
ASUNAM
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--As research into community finding in social networks progresses, there is a need for algorithms capable of detecting overlapping community structure. Many algorithms hav...
SOCIALCOM
2010
13 years 2 months ago
2010
Increasingly, methods to identify community structure in networks have been proposed which allow groups to overlap. These methods have taken a variety of forms, resulting in a lack...
ICDE
2010
IEEE
13 years 9 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
SOCIALCOM
2010
13 years 2 months ago
2010
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
DATAMINE
2010
13 years 4 months ago
2010
In this paper, we introduce a game-theoretic framework to address the community detection problem based on the structures of social networks. We formulate the dynamics of community...