67 search results - page 4 / 14 » Finding Strongly Knit Clusters in Social Networks |
HICSS
2007
IEEE
14 years 14 days ago
2007
IEEE
Research on digital media tends to characterize the emergence of new genres without reference to social networks, even though “community” and “social interaction” are invo...
EDBT
2012
ACM
11 years 8 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
AAAI
2006
13 years 7 months ago
2006
Identifying intrinsic structures in large networks is a fundamental problem in many fields, such as engineering, social science and biology. In this paper, we are concerned with c...
SOUPS
2010
ACM
13 years 10 months ago
2010
ACM
Users of social networking sites often want to manage the sharing of information and content with different groups of people based on their differing relationships. However, group...