About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Abstract
The connection patterns among individuals or objects in complex (social) networks possess rich information that can be useful for conducting effecient network analysis. In particular we consider the task of community detection in social networks. Nowadays social networking sites allow users to categorize their friends into different lists. Some of the examples being 'circles' on Google +, 'lists' on Twitter and Facebook. This information captures the reason of friend- ship between two users. In this paper we explore how this information can lead to detecting better community structures. We pose this task as a community detection problem where the algorithm does not have the information about the underlying edges. Experiments are conducted on 3 real world social networks - Google +, Twitter and Facebook. The experiment shows that results obtained are better than the results obtained by community detection over the original graph. Copyright 2013 ACM.