Advertisement

A Two-Stage Overlapping Community Detection Based on Structure and Node Attributes in Online Social Networks

  • Xinmeng ZhangEmail author
  • Xinguang Li
  • Shengyi Jiang
  • Xia Li
  • Bolin Xie
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 1072)

Abstract

Traditional community detection algorithms are mainly based on network structure, while ignoring a large number of node attributes. In this paper, we propose a two-stage overlapping community detection method which combines structure and attributes(tsocd-SA). First, a set of non-overlapping communities are identified by using existing community detection methods, and community attribute summaries which represents high degree homogeneous attribute value of a community are constructed according to the attributes of the special nodes in the community. Then, we propose a similarity measure between node and community based on network structure and community attribute summary. For connector nodes which connect more than one communities, each node is divided into one or more communities based on the similarity and a specific threshold r. Experimental results in online social network datasets show that our proposed method is more effective than solely focus on structural information.

Keywords

Overlapping community detection Online social network Community attributes summary Similarity 

Notes

Acknowledgments

This research is supported by the National Natural Science Foundation of China (No. 62877013, 61402119).

References

  1. 1.
    Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–7826 (2002)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Newman, M.E.J.: Equivalence between modularity optimization and maximum likelihood methods for community detection. Phys. Rev. E 94(5), 052315 (2016)CrossRefGoogle Scholar
  3. 3.
    Geng, J., Bhattacharya, A., Pati, D.: Probabilistic community detection with unknown number of communities. J. Am. Stat. Assoc. 1–13 (2018)Google Scholar
  4. 4.
    Zhang, X., et al.: Efficient community detection based on label propagation with belonging coefficient and edge probability. In: Li, Y., Xiang, G., Lin, H., Wang, M. (eds.) SMP 2016. CCIS, vol. 669, pp. 54–72. Springer, Singapore (2016).  https://doi.org/10.1007/978-981-10-2993-6_5CrossRefGoogle Scholar
  5. 5.
    Wen, X., Chen, W.N., Lin, Y.: A maximal clique based multiobjective evolutionary algorithm for overlapping community detection. IEEE Trans. Evol. Comput. 21(3), 363–377 (2016)Google Scholar
  6. 6.
    Deng, X., Li, G., Dong, M.: Finding overlapping communities based on Markov chain and link clustering. Peer-to-Peer Netw. Appl. 10(2), 411–420 (2017)CrossRefGoogle Scholar
  7. 7.
    Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009)CrossRefGoogle Scholar
  8. 8.
    Wu, Z.H., Lin, Y.F., Gregory, S.: Balanced multi-label propagation for overlapping community detection in social networks. J. Comput. Sci. Technol. 27(3), 468–479 (2012)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Lu, M., Zhang, Z., Qu, Z., et al.: LPANNI: overlapping community detection using label propagation in large-scale complex networks. IEEE Trans. Knowl. Data Eng. (2018)Google Scholar
  10. 10.
    Xie, J., Szymanski, B.K.: Towards linear time overlapping community detection in social networks. In: Tan, P.-N., Chawla, S., Ho, C.K., Bailey, J. (eds.) PAKDD 2012. LNCS (LNAI), vol. 7302, pp. 25–36. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-30220-6_3CrossRefGoogle Scholar
  11. 11.
    Jun-yu, C., Gang, Z., Xiao-bing, X.: Detecting over-lapping community structure with neighbor voting. J. Chin. Comput. Syst. 35(10), 2272–2277 (2014)Google Scholar
  12. 12.
    Bennett, L., Kittas, A., Liu, S., et al.: Community structure detection for overlapping modules through mathematical programming in protein interaction networks. PLoS ONE 9(11), e112821 (2014)CrossRefGoogle Scholar
  13. 13.
    Cheng, H., Zhou, Y., Jeffrey, X.Y.: Clustering large attributed graphs: a balance between structural and attribute similarities. ACM Trans. Knowl. Discov. Data 5(2), 12 (2011)CrossRefGoogle Scholar
  14. 14.
    Ruan, Y.Y., Fuchry, D., Parthasarathy, S.: Efficient community detection in large networks using content and links. In: Proceedings of the 22nd International Conference on World Wide Web. Seoul, Korea, pp. 1089–1098 (2013)Google Scholar
  15. 15.
    Mcauley, J.J., Leskovec, J.: Learning to discover social circles in ego networks. In: International Conference on Neural Information Processing Systems. Curran Associates Inc. (2012)Google Scholar
  16. 16.
    Rozemberczki, B., Davies, R., Sarkar, R., et al.: Gemsec: graph embedding with self clustering. arXiv preprint arXiv:1802.03997 (2018)
  17. 17.
    Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 2008(10), P1000 (2008)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  • Xinmeng Zhang
    • 1
    • 2
    • 3
    Email author
  • Xinguang Li
    • 1
  • Shengyi Jiang
    • 2
    • 3
  • Xia Li
    • 2
    • 3
  • Bolin Xie
    • 2
    • 3
  1. 1.Laboratory of Language Engineering and ComputingGuangdong University of Foreign StudiesGuangzhouChina
  2. 2.Non-universal Language Intelligent Processing LaboratoryGuangdong University of Foreign StudiesGuangzhouChina
  3. 3.School of Information Science and TechnologyGuangdong University of Foreign StudiesGuangzhouChina

Personalised recommendations