Abstract
Much structured data of scientific interest can be represented as networks, where sets of nodes or vertices are joined together in pairs by links or edges. Although these networks may belong to different research areas, there is one property that many of them do have in common: the network community structure. There has been much recent research on identifying communities in networks. However, most existing approaches require complete network information, which is impractical for some networks, e.g. the World Wide Web or the cell phone telecommunication network. Local community detection algorithms have been proposed to solve the problem but their results usually contain many outliers. In this paper, we propose a new measure of local community structure, coupled with a two-phase algorithm that extracts all possible candidates first, and then optimizes the community hierarchy. We also propose a community discovery process for large networks that iteratively finds communities based on our measure. We compare our results with previous methods on real world networks such as the co-purchase network from Amazon. Experimental results verify the feasibility and effectiveness of our approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. A. Adamic and N. Glance. The political blogosphere and the 2004 u.s. election: divided they blog. In LinkKDD’ 05, pages 36–43, 2005.
S. O. Aral, J. P. Hughes, B. Stoner, W. Whittington, H. H. Handsfield, R. M. Anderson, and K. K. Holmes. Sexual mixing patterns in the spread of gonococcal and chlamydial infections. American Journal of Public Health, 89:825–833, 1999.
J. P. Bagrow. Evaluating local community methods in networks. J.STAT.MECH., page P05001, 2008.
J. P. Bagrow and E. M. Bollt. Local method for detecting communities. Physical Review E, 72(4), 2005.
A. Clauset. Finding local community structure in networks. Physical Review E, 72:026132, 2005.
A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Phys. Rev. E, 70:066111, 2004.
L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas. Comparing community structure identification. J. Stat. Mech, page P09008, 2005.
I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic coclustering. In KDD, pages 89–98, 2003.
C. H. Q. Ding, X. He, H. Zha, M. Gu, and H. D. Simon. A min-max cut algorithm for graph partitioning and data clustering. In ICDM, pages 107–114, 2001.
J. Duch and A. Arenas. Community detection in complex networks using extremal optimization. Phys. Rev. E, 72:027104, 2005.
G. W. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In KDD, pages 150–160, 2000.
S. Fortunate Community detection in graphs. Physics Reports, 486:75–174, 2010.
G. P. Garnett, J. P. Hughes, R. M. Anderson, B. P. Stoner, S. O. Aral, W. L. Whittington, H. H. Handsfield, and K. K. Holmes. Sexual mixing patterns of patients attending sexually transmitted diseases clinics. Sexually Transmitted Diseases, 23:248–257, 1996.
M. Girvan and M. Newman. Community structure in social and biological networks. In PNAS USA, 99:8271–8276, 2002.
S. Gregory. An algorithm to find overlap** community structure in networks. In PKDD, pages 91–102, 2007.
R. Guimera and L. A. N. Amaral. Functional cartography of complex metabolic networks. Nature, 433:895–900, 2005.
S. Gupta. R. M. Anderson, and R. M. May. Networks of sexual contacts: Implications for the pattern of spread of hiv. AIDS, 3:807–817, 1989.
D. Jensen. Statistical challenges to inductive inference in linked data, 1999.
G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distriuted Computing, 48(1):96–129, 1998.
B. Long, X. Wu, Z. M. Zhang, and P. S. Yu. Unsupervised learning on k-partite graphs. In KDD, pages 317–326, 2006.
B. Long, Z. M. Zhang, and P. S. Yu. A probabilistic framework for relational clustering. In KDD, pages 470–479, 2007.
F. Luo, J. Z. Wang, and E. Promislow. Exploring local community structures in large networks. In WI’ 06: Proceedings of the 2006 IEEE/WIC/ACM International Conference, on Web Intelligence, pages 233–239, 2006.
M. A. Nascimento, Jörg Sander, and J. Pound. Analysis of sigmod’s co-authorship graph. SIGMOD Record, 32(2):57–58, 2003.
T. Nepusz, A. Pctroczi, L. Negyessy, and F. Bazso. Fuzzy communities and the concept of bridgeness in complex networks. Physical Review E, 77, 2008.
M. E. J. Newman. Fast algorithm for detecting community structure in networks. Physical Review E, 69, 2004.
M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74, 2006.
M. E. J. Newman. Modularity and community structure in networks. PNAS USA. 103, 2006.
M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69, 2004.
G. Palla, I. Derenyi, I. Farkas, and T. Vicsek. Uncovering the overlap** community structure of complex networks in nature and society. Nature, 435:814, 2005.
J. Ruan and W. Zhang. An efficient spectral algorithm for network community discovery and its applications to biological and social networks. In ICDM, pages 643–648, 2007.
S. E. Schaeffer. Graph clustering. Computer Science Review, 1:27–64, 2007.
J. Scott. Social network analysis: A handbook, Sage, London 2nd edition (2000).
J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE. Trans, on Pattern Analysis and Machine Intelligence, 2000.
A. F. Smeaton, G. Keogh, C. Gurrin, K. McDonald, and T. Sodring. Analysis of papers from twenty-five years of sigir conferences: What have we been doing for the last quarter of a century. SIGIR Forum, 36(2):39–43, 2002.
J. R. Tyler, D. M. Wilkinson, and B. A. Huberman. Email as spectroscopy: automated discovery of community structure within organizations. Communities and technologies, pages 81–96, 2003.
S. White and P. Smyth. A spectral clustering approach to finding communities in graphs. In SIAM, 2005.
X. Xu, N. Yuruk, Z. Feng, and T. A. J. Schweiger. Scan: a structural clustering algorithm for networks. In KDD, pages 824–833, 2007.
S. Zhang, R. Wang, and X. Zhang. Identification of overlap** community structure in complex networks using fuzzy c-means clustering. Physica A, 374:483–490, 2007.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag/Wien
About this chapter
Cite this chapter
Chen, J., Zaïane, O.R., Goebel, R. (2010). Detecting Communities in Social Networks Using Local Information. In: Memon, N., Alhajj, R. (eds) From Sociology to Computing in Social Networks. Springer, Vienna. https://doi.org/10.1007/978-3-7091-0294-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-7091-0294-7_11
Publisher Name: Springer, Vienna
Print ISBN: 978-3-7091-0293-0
Online ISBN: 978-3-7091-0294-7
eBook Packages: Computer ScienceComputer Science (R0)