The k-Dense Method to Extract Communities from Complex Networks
To understand the structural and functional properties of large-scale complex networks, it is crucial to efficiently extract a set of cohesive subnetworks as communities. There have been proposed several such community extraction methods in the literature, including the classical k-core decomposition method and, more recently, the k-clique based community extraction method. The k-core method, although computationally efficient, is often not powerful enough for uncovering a detailed community structure and it only discovers coarse-grained and loosely connected communities. The k-clique method, on the other hand, can extract fine-grained and tightly connected communities but requires a substantial amount of computational load for large-scale complex networks. In this paper, we present a new notion of a subnetwork called k-dense, and propose an efficient algorithm for extracting k-dense communities. We applied our method to the three different types of networks assembled from real data, namely, from blog trackbacks, word associations and Wikipedia references, and demonstrated that the k-dense method could extract communities almost as efficiently as the k-core method, while the qualities of the extracted communities are comparable to those obtained by the k-clique method.
KeywordsAdjacent Node Word Association Community Size Maximum Community Strong Positive Relation
Unable to display preview. Download preview PDF.
- 1.Applegate, D., Johnson, D.S.: Clique-finding program dfmax.c, C program, ftp://dimacs.rutgers.edu/pub/challenge/graph/solvers/
- 2.Batagelj, V., Zaversnik, M.: Generalized Cores, arXiv:cs.DS/0202039 (2002)Google Scholar
- 5.Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of Web communities. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 150–160 (2000)Google Scholar
- 7.Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. In: Proceedings of the National Academy of Sciences of the United States of America, vol. 99, pp. 7821–7826 (2002)Google Scholar
- 8.Kamada, T., Kawai, S.: An algorithm for drawing general undirected graph. Information Processing Letters 32, 7–15 (1989)Google Scholar
- 9.Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the Web for emerging cyber-communities. In: Proceedings of the 8th International World Wide Web Conference (1999)Google Scholar
- 11.Nelson, D.L., McEvoy, C.L., Schreiber, T.A.: The University of South Florida word association norms, http://w3.usf.edu/FreeAssociation
- 13.Kimura, M., Saito, K., Kazama, K., Sato, S.: Detecting Search Engine Spam from a Trackback Network in Blogspace. In: Proceedings of KES 2005, Vol. IV, pp. 723–729 (2005)Google Scholar
- 14.Seidman, S.B.: Network Structure and Minimum Degree. Social Networks 5, 269–287 (1983)Google Scholar
- 15.Shi, R., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. PAMI 22(8), 888–905 (2000)Google Scholar
- 17.Yamada, T., Saito, K., Kazama, K.: Network analyses to understand the structure of Wikipedia. In: Proceedings of AISB 2006, vol. 3, pp. 195–198 (2006)Google Scholar