Many researchers have studied complex networks such as the World Wide Web, social networks, and the protein interaction network. They have found scale-free characteristics, the small-world effect, the property of high-clustering coefficient, and so on. One hot topic in this area is community detection. For example, the community shows a set of web pages about a certain topic in the WWW. The community structure is unquestionably a key characteristic of complex networks. In this paper, we propose a new method for finding communities in complex networks. Our proposed method considers the overlaps between communities using the concept of the intersection graph. Additionally, we address the problem of edge inhomogeneity by weighting edges using the degree of overlaps and the similarity of content information between sets. Finally, we conduct clustering based on modularity. And then, we evaluate our method on a real SNS network.

No abstract

Many researchers have studied about complex networks such as the World Wide Web, social networks and the protein interaction network. One hot topic in this area is community detection. For example, in the WWW, the community shows a set of web pages about a certain topic. The community structure is unquestionably a key characteristic of complex networks. We have proposed the novel community extracting method. The method considers the overlaps between communities using the idea of the intersection graph. Additionally, we address the problem of edge inhomogeneity by weiting edges using content information. Finally, we conduct clustering based on modularity. In this paper, we evaluate our method through applying to real microblog networks.

No abstract