Skip to main content

Maximal Labeled-Cliques for Structural-Functional Communities

  • Conference paper
  • First Online:
Complex Networks & Their Applications IX (COMPLEX NETWORKS 2020 2020)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 943))

Included in the following conference series:

  • 2580 Accesses

Abstract

Cliques are important building blocks for community structure in networks representing structural association between entities. Bicliques play a similar role for bipartite networks representing functional attributes (aka. labels) of entities. We recently proposed a combination of these structures known as labeled-cliques and designed an algorithm to identify them. In this work we show how to use these structures to identify structural-functional communities in networks. We also designed a few metrics to analyse those communities.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Baroni, A., Conte, A., Patrignani, M., Ruggieri, S.: Efficiently clustering very large attributed graphs. In: 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 369–376 (2017)

    Google Scholar 

  2. Bera, D., Esposito, F., Pendyala, M.: Maximal labelled-clique and click-biclique problems for networked community detection. In: 2018 IEEE Global Communications Conference (GLOBECOM), pp. 1–6 (2018)

    Google Scholar 

  3. Cantador, I., Brusilovsky, P., Kuflik, T.: Second workshop on information heterogeneity and fusion in recommender systems. In: Proceedings of the 5th ACM Conference on Recommender Systems, (HetRec 2011) (2011)

    Google Scholar 

  4. Chin, C.H., Chen, S.H., Wu, H.H., Ho, C.W., Ko, M.T., Lin, C.Y.: cytohubba: identifying hub objects and sub-networks from complex interactome. BMC Syst. Biol. 8(4), S11 (2014)

    Article  Google Scholar 

  5. Chunaev, P.: Community detection in node-attributed social networks: a survey. Comput. Sci. Rev. 37, 100286 (2020). http://www.sciencedirect.com/science/article/pii/S1574013720303865

    Article  MathSciNet  Google Scholar 

  6. Faghani, M.R., Nguyen, U.T.: A study of malware propagation via online social networking. In: Mining Social Networks and Security Informatics. Springer, Netherlands (2013)

    Google Scholar 

  7. Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  8. Guo, G., Zhang, J., Thalmann, D., Yorke-Smith, N.: ETAF: an extended trust antecedents framework for trust prediction. In: Proceedings of the 2014 International Conference on Advances in Social Networks Analysis and Mining (2014)

    Google Scholar 

  9. Guo, G., Zhang, J., Yorke-Smith, N.: A novel Bayesian similarity measure for recommender systems. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (2013)

    Google Scholar 

  10. Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a social network or a news media? In: Proceedings of 19th International Conference on World Wide Web (2010)

    Google Scholar 

  11. Latapy, M., Magnien, C., Vecchio, N.D.: Basic notions for the analysis of large two-mode networks. Soc. Netw. 30(1), 31–48 (2008)

    Article  Google Scholar 

  12. Lesser, O., Tenenboim-Chekina, L., Rokach, L., Elovici, Y.: Intruder or welcome friend: inferring group membership in online social networks. In: Social Computing, Behavioral-Cultural Modeling and Prediction (2013)

    Google Scholar 

  13. Modani, N., et al.: Like-minded communities: bringing the familiarity and similarity together. World Wide Web 17(5), 899–919 (2014)

    Article  Google Scholar 

  14. Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)

    Article  MathSciNet  Google Scholar 

  15. Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)

    Book  Google Scholar 

  16. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2) (2004)

    Google Scholar 

  17. Nicosia, V., Mangioni, G., Carchiolo, V., Malgeri, M.: Extending the definition of modularity to directed graphs with overlapping communities. J. Stat. Mech. Theor. Exp. 2009, P03024 (2008)

    MATH  Google Scholar 

  18. Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)

    Article  Google Scholar 

  19. Plantié, M., Crampes, M.: Survey on social community detection. In: Social Media Retrieval (2013)

    Google Scholar 

  20. Saracco, F., Di Clemente, R., Gabrielli, A., Squartini, T.: Randomizing bipartite networks: the case of the world trade web. Sci. Rep. 5, 10595 (2015)

    Article  Google Scholar 

  21. Saracco, F., Straka, M.J., Clemente, R.D., Gabrielli, A., Caldarelli, G., Squartini, T.: Inferring monopartite projections of bipartite networks: an entropy-based approach. New J. Phys. 19(5), 053022 (2017)

    Article  Google Scholar 

  22. Shen, H., Cheng, X., Cai, K., Hu, M.B.: Detect overlapping and hierarchical community structure in networks. Physica A: Stat. Mech. Appl. 388(8), 1706–1712 (2009)

    Article  Google Scholar 

  23. Spyropoulou, E., De Bie, T., Boley, M.: Interesting pattern mining in multi-relational data. Data Min. Knowl. Disc. 28(3), 808–849 (2014)

    Article  MathSciNet  Google Scholar 

  24. Wan, L., Liao, J., Wang, C., Zhu, X.: JCCM: Joint cluster communities on attribute and relationship data in social networks. In: Proceedings of 5th International Conference on Advanced Data Mining and Applications (2009)

    Google Scholar 

  25. Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst. 42(1), 181–213 (2015)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Debajyoti Bera .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bera, D. (2021). Maximal Labeled-Cliques for Structural-Functional Communities. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds) Complex Networks & Their Applications IX. COMPLEX NETWORKS 2020 2020. Studies in Computational Intelligence, vol 943. Springer, Cham. https://doi.org/10.1007/978-3-030-65347-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-65347-7_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-65346-0

  • Online ISBN: 978-3-030-65347-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics