Skip to main content
Springer Nature Link
Log in

A new algorithm for communities detection in social networks with node attributes

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

Revealing the community structure in social networks witnessed a determined effort. In this respect, a different category of social network can be handled, such as, dynamic social networks, social networks with node attributes, etc. In this article, we introduce a new method to solve this thriving issue in the social network with node attributes. This latter can be represented by a bipartite graph, which consists of a two sets of nodes and edges connecting these nodes. The tendency of people with similar node attributes leads to the hidden information of clusters or communities. A wealthy number of community-detection algorithms have been proposed for bipartite graphs and applied to several domains in the literature. To palliate some of the highlighted shortcomings, we introduce a new approach, called Fast-Bi Community Detection (FBCD), that aims to an efficient community detection in social networks. The main idea of this approach is to explore the set of maximum matching in the bipartite graph in order to reduce the complexity of our algorithm. The carried out experiments show the high quality of the obtained communities versus those by the pioneering ones of the literature.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. \(\textit{Supp}(\wedge \textit{I}) = \cap {\phi (i), i \in \textit{I}}\).

  2. \(\textit{Supp}(\vee \textit{I}) = \cup {\phi (i), i \in \textit{I}}\).

  3. http://konect.uni-koblenz.de/.

  4. Southern women network dataset-KONECT (2016).

  5. American Revolution network dataset-KONECT (2016).

  6. Corporate Leadership network dataset-KONECT (2016).

  7. South African Companies network dataset-KONECT (2016).

  8. http://snap.stanford.edu.

  9. http://networkrepository.com.

References

  • Asratian AS, Denley TMJ, Häggkvist R (1998) Bipartite graphs and their applications. Cambridge University Press, New York

    Book  Google Scholar 

  • Barber MJ (2007) Modularity and community detection in bipartite networks. Phys Rev E 76(6):066102

    Article  ADS  MathSciNet  Google Scholar 

  • Barbut M, Monjardet B (1970) Ordre et classification. Algèbre et Combinatoire, Hachette, Tome II

  • Ben Yahia S, Mephu Nguifo E (2004) Approches d’extraction de règles d’association basées sur la correspondance de galois. Ingénierie des Systèmes d’Information 9(3–4):23–55

    Article  Google Scholar 

  • Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 10:P10008

    Article  Google Scholar 

  • Coscia M, Rossetti G, Giannotti F, Pedreschi D (2012) DEMON: a local-first discovery method for overlapping communities. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’12, Beijing, China, pp 615–623

  • Dai T, Zhu L, Cai X, Pan S, Yuan S (2018) Explore semantic topics and author communities for citation recommendation in bipartite bibliographic network. J Ambient Intell Human Comput (JAIHC) 9(4):957–975

    Article  Google Scholar 

  • Davis A, Gardner BB, Gardner MR (2009) Deep south: a social anthropological study of caste and class. University of South Carolina Press, Southern classics series

  • Gibbons A (1985) Algorithmic graph theory. Cambridge University Press, Cambridge

    Google Scholar 

  • Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826

    Article  ADS  MathSciNet  CAS  PubMed  PubMed Central  Google Scholar 

  • González-Pardo A, Jung JJ, Camacho D (2017) Aco-based clustering for ego network analysis. Future Gener Comput Syst 66:160–170

    Article  Google Scholar 

  • Guimerà R, Sales-Pardo M, Amaral LAN (2007) Module identification in bipartite and directed networks. Phys Rev E 76(3):036,102

    Article  Google Scholar 

  • Hamrouni T, Ben Yahia S, Mephu Nguifo E (2008) Succinct minimal generators: theoretical foundations and applications. Int J Found Comput Sci 19(02):271–296

    Article  MathSciNet  Google Scholar 

  • Hwang CL, Yoon K (1981) Multiple attribute decision making: methods and applications, vol 186. Springer, Berlin

    Google Scholar 

  • Hwang CL, Lai YJ, Liu TY (1993) A new approach for multiple objective decision making. Comput Operat Res 20:889–899

    Article  Google Scholar 

  • Jelassi MN, Largeron C, Ben Yahia S (2014) Efficient unveiling of multi-members in a social network. J Syst Softw 94:30–38

    Article  Google Scholar 

  • Kannan R, Vempala S, Vetta A (2000) On clusterings-good, bad and spectral. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE Computer Society

  • Lancichinetti A, Radicchi F, Ramasco JJ, Fortunato S (2010) Finding statistically significant communities in networks. CoRR abs/1012.2363

  • Mouakher A, Ben Yahia S (2019) On the efficient stability computation for the selection of interesting formal concepts. Inf Sci 472:15–34

    Article  Google Scholar 

  • Mouakher A, Yahia SB (2016) Qualitycover: efficient binary relation coverage guided by induced knowledge quality. Inf Sci 355–356:58–73

    Article  Google Scholar 

  • Mouakher A, Ktayfi O, Ben Yahia S (2019) Scalable computation of the extensional and intensional stability of formal concepts. International Journal of General Systems

  • Mucha M, Sankowski P (2004) Maximum matchings via gaussian elimination. In: Proceedings of the 45th IEEE Symp. Foundations of Computer Science FOCS, IEEE Computer Society, pp 248–255

  • Murata T (2009) Community division of heterogeneous networks. In: Proceedings of 1st international conference complex sciences: theory and applications. Springer, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 4, pp 1011–1022

  • Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167–256

    Article  ADS  MathSciNet  Google Scholar 

  • Newman ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(026113):026113

    Article  ADS  CAS  Google Scholar 

  • Omiecinski ER (2003) Alternative interest measures for mining associations in databases. IEEE Trans Knowl Data Eng 15(1):57–69

    Article  MathSciNet  Google Scholar 

  • Pons P, Latapy M (2006) Computing communities in large networks using random walks. J Graph Algorithms Appl 10(2)

  • Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):036106

    Article  ADS  Google Scholar 

  • Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118–1123

    Article  ADS  CAS  PubMed  PubMed Central  Google Scholar 

  • Roth C, Obiedkov S, Kourie DG (2007) Towards concise representation for taxonomies of epistemic communities. In: Proceedings of the 4th international conference on concept lattices and their applications (CLA), Springer, Lecture Notes in Computer Science, vol 4923, pp 240–255

  • Uno T, Asai T, Uchida Y, Arimura H (2004) An efficient algorithm for enumerating closed patterns in transaction databases. In: Proceedings of the 7th international conference discovery science, DS 2004, Padova, Italy, pp 16–31

  • Uno T, Kiyomi M, Arimura H (2005) Lcm ver.3: Collaboration of array, bitmap and prefix tree for frequent itemset mining. In: Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations, ACM, New York, NY, USA, OSDM ’05, pp 77–86

  • Viard J, Latapy M (2014) Identifying roles in an IP network with temporal and structural density. In: Proceedings of the IEEE INFOCOM workshops, Toronto, ON, Canada, pp 801–806

  • Xu K, Tang C, Li C, Jiang Y, Tang R (2010) An MDL approach to efficiently discover communities in bipartite network. In: Proceedings of the 15th international conference database systems for advanced applications, Springer, Lecture Notes in Computer Science, vol 5981, pp 595–611

  • Yang J, Leskovec J (2012) Community-affiliation graph model for overlapping network community detection. In: Proceedings of the 12th ieee international conference on data mining, ICDM 2012, Brussels, Belgium, pp 1170–1175

  • Yong-Yeol A, Bagrow JP, Lehmann S (2010) Link communities reveal multiscale complexity in networks. Nature 466:761

    Article  ADS  Google Scholar 

  • Zanakis SH, Solomon A, Wishart N, Dublish S (1998) Multi-attribute decision making: a simulation comparison of select methods. Eur J Oper Res 107(3):507–529

    Article  Google Scholar 

Download references

Acknowledgements

This work has been funded by the Justice Program of the European Union (2014-2020) 723180—RiskTrack—JUST-2015-JCOO-AG/JUST-2015-JCOO-AG-1. The contents of this publication are the sole responsibility of their authors and can in no way be taken to reflect the views of the European Commission.

Author information

Authors and Affiliations

  1. Faculty of Sciences of Tunis, LIPAH-LR 11ES14, University of Tunis El Manar, 2092, Tunis, Tunisia

    Haifa Gmati & Amira Mouakher

  2. Escuela Politecnica Superior, Universidad Autonoma de Madrid, Madrid, Spain

    Antonio Gonzalez-Pardo & David Camacho

Authors
  1. Haifa Gmati
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Amira Mouakher
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Antonio Gonzalez-Pardo
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. David Camacho
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Antonio Gonzalez-Pardo.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gmati, H., Mouakher, A., Gonzalez-Pardo, A. et al. A new algorithm for communities detection in social networks with node attributes. J Ambient Intell Human Comput 15, 1779–1791 (2024). https://doi.org/10.1007/s12652-018-1108-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-018-1108-5

Keywords