Abstract
Community structure is an important property of complex networks, which is generally described as densely connected nodes and similar patterns of links. Hierarchy is a common property of networks. Different members have different belonging coefficients to the community, e.g. core members and boundary members, who are at different levels in the hierarchy of community. In this paper, a novel structure is presented, called hierarchical structure of members (HSM), which shows the relationships among members and multi-resolution of the community. A hierarchical link-pattern expansion method is proposed to detect HSM. First, we use the most similar link patterns to detect the seed communities which include both clique structures and star structures. Next, we define the influence between members to expand the community hierarchically. The experiment explores the hierarchical structure of members and the comparison with competitive algorithms on real-world networks demonstrates our method has stronger ability to detect communities.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761–764 (2010)
Chen, D., Shang, M., Lv, Z., Fu, Y.: Detecting overlapping communities of weighted networks via a local algorithm. Physica A: Statistical Mechanics and its Applications 389(19), 4177–4187 (2010)
Dawah, H.A., Hawkins, B.A., Claridge, M.F.: Structure of the parasitoid communities of grass-feeding chalcid wasps. Journal of Animal Ecology, 708–720 (1995)
Fortunato, S.: Community detection in graphs. Physics Reports 486(3), 75–174 (2010)
Fushing, H., McAssey, M.P., Beisner, B., McCowan, B.: Ranking network of a captive rhesus macaque society: a sophisticated corporative kingdom. PloS One 6(3), e17817 (2011)
Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences 99(12), 7821–7826 (2002)
Gleich, D.F., Seshadhri, C.: Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 597–605. ACM (2012)
Havemann, F., Heinz, M., Struck, A., Gläser, J.: Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels. Journal of Statistical Mechanics: Theory and Experiment 2011(1), P01023 (2011)
Jin, D., Yang, B., Baquero, C., Liu, D., He, D., Liu, J.: A markov random walk under constraint for discovering overlapping communities in complex networks. Journal of Statistical Mechanics: Theory and Experiment 2011(5), P05031 (2011)
Knuth, D.E., Knuth, D.E., Knuth, D.E.: The Stanford GraphBase: a platform for combinatorial computing, vol. 37. Addison-Wesley Reading (1993)
Krogan, N.J., Cagney, G., Yu, H., Zhong, G., Guo, X., Ignatchenko, A., Li, J., Pu, S., Datta, N., Tikuisis, A.P., et al.: Global landscape of protein complexes in the yeast saccharomyces cerevisiae. Nature 440(7084), 637–643 (2006)
Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics 11(3), 033015 (2009)
Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. PloS One 6(4), e18961 (2011)
Lee, C., Reid, F., McDaid, A., Hurley, N.: Detecting highly overlapping community structure by greedy clique expansion. arXiv preprint arXiv:1002.1827 (2010)
Lusseau, D.: The emergent properties of a dolphin social network. Proceedings of the Royal Society of London. Series B: Biological Sciences 270(suppl. 2), S186–S188 (2003)
McDaid, A., Hurley, N.: Detecting highly overlapping communities with model-based overlapping seed expansion. In: 2010 International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 112–119. IEEE (2010)
Nagy, M., Ákos, Z., Biro, D., Vicsek, T.: Hierarchical group dynamics in pigeon flocks. Nature 464(7290), 890–893 (2010)
Newman, M.E.: Finding community structure in networks using the eigenvectors of matrices. Physical Review E 74(3), 036104 (2006)
Pumain, D.: Hierarchy in natural and social sciences, vol. 3. Springer (2006)
Uetz, P., Giot, L., Cagney, G., Mansfield, T.A., Judson, R.S., Knight, J.R., Lockshon, D., Narayan, V., Srinivasan, M., Pochart, P., et al.: A comprehensive analysis of protein–protein interactions in saccharomyces cerevisiae. Nature 403(6770), 623–627 (2000)
Xie, J., Szymanski, B.K., Liu, X.: SLPA: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: 2011 IEEE 11th International Conference on Data Mining Workshops (ICDMW), pp. 344–349. IEEE (2011)
Yu, H., Braun, P., Yıldırım, M.A., Lemmens, I., Venkatesan, K., Sahalie, J., Hirozane-Kishikawa, T., Gebreab, F., Li, N., Simonis, N., et al.: High-quality binary protein interaction map of the yeast interactome network. Science 322(5898), 104–110 (2008)
Zachary, W.: An information flow modelfor conflict and fission in small groups1. Journal of Anthropological Research 33(4), 452–473 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Chen, F., Li, K. (2014). Detecting Hierarchical Structure of Community Members by Link Pattern Expansion Method. In: Benatallah, B., Bestavros, A., Manolopoulos, Y., Vakali, A., Zhang, Y. (eds) Web Information Systems Engineering – WISE 2014. WISE 2014. Lecture Notes in Computer Science, vol 8786. Springer, Cham. https://doi.org/10.1007/978-3-319-11749-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-11749-2_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11748-5
Online ISBN: 978-3-319-11749-2
eBook Packages: Computer ScienceComputer Science (R0)