Extracting communities from complex networks by the k-dense method

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E91-A, Issue 11, 2008, Pages 3304-3311

  Saito, Kazumi ^a   Yamada, Takeshi ^a,c   Kazama, Kazuhiro ^b  

^a NTT Communication Science Laboratories   (Japan)

^b NTT Network Innovation Laboratories   (Japan)

^c UNIVERSITY OF SHIZUOKA   (Japan)

Author keywords

Community extraction; Complex network; K clique; K core; Kdense

Indexed keywords

DATA MINING; EXTRACTION;

COMMUNITY EXTRACTIONS; COMMUNITY STRUCTURES; COMPUTATIONALLY EFFICIENT; DECOMPOSITION METHODS; FUNCTIONAL PROPERTIES; K-CLIQUE; K-CORES; KDENSE;

COMPLEX NETWORKS;

EID: 77953370960     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e91-a.11.3304     Document Type: Article

References (18)

1. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol.286, pp.509-512, 1999.
2. D. Applegate and D.S. Johnson, dfmax.c at URL: ftp://dimacs. rutgers.edu/pub/challenge/graph/solvers/
3. V. Batagelj and M. Zaveřsnik, Generalized Cores, arXiv:cs.DS/ 0202039, 2002.
4. V. Batagelj and M. Zaveřsnik, An O(m) algorithm for cores decompotion of networks, arXiv:cs.DS/0310049, 2003.
5. U. Brendes and T. Erlebach, Network Analysis, Springer, 2005.
6. R. Carragan and P.M. Pardalos, "An exact algorithm for the maximum clique problem," Oper. Res. Lett., vol.9, pp.375-382, 1990.
7. M. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, CA, 1979.
8. M. Girvan and M.E.J. Newman, "Community structure in social and biological networks," Proc. Natl. Acad. Sci. US, vol.99, pp.7821- 7826, 2002.
9. T. Kamada and S. Kawai, "An algorithm for drawing general undirected graph," Inf. Process. Lett., vol.32, pp.7-15, 1989.
10. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "Trawling the Web for emerging cyber-communities," Proc. 8th International World Wide Web Conference, 1999.
11. G. Palla, I. Derényi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society," Nature, vol.435, pp.814-818, 2005.
12. D.L. Nelson, C.L. McEvoy, and T.A. Schreiber, The University of South Florida word association norms, http://w3.usf.edu/Free Association
13. M.E.J. Newman, "The structure and function of complex network," SIAM Review, vol.45, no.2, pp.167-256, 2003.
14. M. Kimura, K. Saito, K. Kazama, and S. Sato, "Detecting search engine spam from a trackback network in blogspace," Proc. KES'05, IV, pp.723-729, 2005.
15. S.B. Seidman, "Network structure and minimum degree," Social Networks, vol.5, pp.269-287, 1983.
16. R. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Trans. Pattern Anal. Mach. Intell., vol.22, no.8, pp.888-905, 2000.
17. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa, "A new algorithm for generating all the maximal independent sets," SIAM J. Comput., vol.6, pp.505-517, 1977.
18. T. Yamada, K. Saito, and K. Kazama, "Network analyses to understand the structure of Wikipedia," Proc. AISB'06, vol.3, pp.195- 198, 2006.