Advertisement

Overlapping Community Detection Using Core Label Propagation and Belonging Function

  • Jean-Philippe AttalEmail author
  • Maria Malek
  • Marc Zolghadri
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9949)

Abstract

Label propagation is one of the fastest methods for community detection, with a near linear time complexity. It acts locally. Each node interacts with neighbours to change its own label by a majority vote. But this method has three major drawbacks: (i) it can lead to huge communities without sense called also monster communities, (ii) it is unstable, and (iii) it is unable to detect overlapping communities.

In this paper, we suggest new techniques that improve considerably the basic technique by using an existing core detection label propagation technique. It is then possible to detect overlapping communities through a belonging function which qualifies the belonging degree of nodes to several communities.

Nodes are assigned and replicated by the function a number of times to communities which are found automatically. User may also interact with the technique by imposing and freezing the number of communities a node may belong to. A comparative analysis will be done.

References

  1. 1.
    Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)CrossRefGoogle Scholar
  2. 2.
    Attal, J.-P., Malek, M.: A new label propagation with dams. In: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 1292–1299. ACM (2015)Google Scholar
  3. 3.
    Seifi, M., Junier, I., Rouquier, J.-B., Iskrov, S., Guillaume, J.-L.: Stable community cores in complex networks. In: Menezes, R., Evsukoff, A., González, M.C. (eds.) Complex Networks. SCI, vol. 424, pp. 87–98. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  4. 4.
    Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393, 440–442 (1998)CrossRefGoogle Scholar
  5. 5.
    Nicosia, V., Mangioni, G., Carchiolo, V., Malgeri, M.: Extending the definition of modularity to directed graphs with overlapping communities. J. Stat. Mech. Theory Exp. 2009(03), P03024 (2009)CrossRefGoogle Scholar
  6. 6.
    Ana, L., Jain, A.K.: Robust data clustering. In: Proceedings of 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2, p. II-128. IEEE (2003)Google Scholar
  7. 7.
    Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193–218 (1985)CrossRefzbMATHGoogle Scholar
  8. 8.
    Zachary, W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (1977)CrossRefGoogle Scholar
  9. 9.
    Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–7826 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Krebs, V.: Books about US politics (2004). http://www.orgnet.com/
  11. 11.
    Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4), 396–405 (2003)CrossRefGoogle Scholar
  12. 12.
    Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 22 pages, 8 figures, minor corrections in this version. http://arxiv.org/abs/physics/0605087
  13. 13.
    Gleiser, P., Danon, L.: Community structure in jazz. In: Advances in Complex Systems, vol. 6, p. 565 (2003). doi: 10.1142/S0219525903001067 Google Scholar
  14. 14.
    Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature, society. Nature, 435(7043), 814–818. http://dx.doi.org/10.1038/nature03607 Google Scholar
  15. 15.
    Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 103018 (2010)CrossRefGoogle Scholar
  16. 16.
    Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. PLoS ONE 6(4), e18961 (2011)CrossRefGoogle Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    Gregory, S.: An algorithm to find overlapping community structure in networks. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 91–102. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Jean-Philippe Attal
    • 1
    Email author
  • Maria Malek
    • 1
  • Marc Zolghadri
    • 2
  1. 1.Quartz Laboratory, EISTICergyFrance
  2. 2.Quartz Laboratory, SUPMECASaint-OuenFrance

Personalised recommendations