Interpreting communities based on the evolution of a dynamic attributed network

  • Günce Keziban Orman
  • Vincent Labatut
  • Marc Plantevit
  • Jean-François Boulicaut
Original Article

Abstract

Many methods have been proposed to detect communities, not only in plain, but also in attributed, directed, or even dynamic complex networks. From the modeling point of view, to be of some utility, the community structure must be characterized relatively to the properties of the studied system. However, most of the existing works focus on the detection of communities, and only very few try to tackle this interpretation problem. Moreover, the existing approaches are limited either by the type of data they handle or by the nature of the results they output. In this work, we see the interpretation of communities as a problem independent from the detection process, consisting in identifying the most characteristic features of communities. We give a formal definition of this problem and propose a method to solve it. To this aim, we first define a sequence-based representation of networks, combining temporal information, community structure, topological measures, and nodal attributes. We then describe how to identify the most emerging sequential patterns of this dataset and use them to characterize the communities. We study the performance of our method on artificially generated dynamic attributed networks. We also empirically validate our framework on real-world systems: a DBLP network of scientific collaborations, and a LastFM network of social and musical interactions.

Keywords

Dynamic attributed networks Community interpretation  Topological measures Emerging sequence mining 

References

  1. Aynaud T, Guillaume J-L (2010) Static community detection algorithms for evolving networks. In: Modeling and optimization in mobile, ad hoc and wireless networks (WiOpt), 2010 proceedings of the 8th international symposium on, pp 513–519Google Scholar
  2. Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech 10:P10008CrossRefGoogle Scholar
  3. Blondel VD (2011) The Louvain method for community detection in large networks. http://perso.uclouvain.be/vincent.blondel/research/louvain.html
  4. Bonacich P (1987) Power and centrality: a family of measures. Am J Sociol 92(5):1170–1182CrossRefGoogle Scholar
  5. Chen J, Tang Y, Li J, Mao C, Xiao J (2014) Community-based scholar recommendation modeling in academic social network sites. In: Huang Z, Liu C, He J, Huang G (eds) Web information systems engineering WISE 2013 workshops. Lecture notes in computer science. Springer, Berlin, pp 325–334CrossRefGoogle Scholar
  6. Desmier E, Plantevit M, Robardet C, Boulicaut J-F (2012) Cohesive co-evolution patterns in dynamic attributed graphs. In: Ganascia J-G, Lenca P, Petit J-M (eds) Discovery science. Lecture notes in computer science. Springer, Berlin, pp 110–124Google Scholar
  7. Dong G, Li J (1999) Efficient mining of emerging patterns: discovering trends and differences. In: Proceedings of the fifth ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’99, ACM, New York, pp 43–52Google Scholar
  8. Dugué N, Labatut V, Perez A (2014) Identification de rôles communautaires dans des réseaux orientés appliqué twitter. In: 14ème Conférence Extraction et Gestion des Connaissances (EGC)Google Scholar
  9. Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174MathSciNetCrossRefGoogle Scholar
  10. Fortunato S, Lancichinetti A (2009) Community detection algorithms: a comparative analysis: invited presentation, extended abstract. In: Proceedings of the fourth international ICST conference on performance evaluation methodologies and tools, VALUETOOLS ’09, ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering). ICST, Brussels, pp 27:1–27:2Google Scholar
  11. Freeman L (1979) Centrality in social networks I: conceptual clarification. Soc Netw 1(3):215–239CrossRefGoogle Scholar
  12. Gallo A, De Bie T, Cristianini N (2007) Mini: mining informative non-redundant itemsets. Knowledge Discovery in Databases: PKDD 2007. Lecture notes in computer science. Springer, Berlin, pp 438–445CrossRefGoogle Scholar
  13. Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821–7826MATHMathSciNetCrossRefGoogle Scholar
  14. Greene D, Doyle D, Cunningham P (2010) Tracking the evolution of communities in dynamic social networks. In: Advances in social networks analysis and mining (ASONAM), 2010 international conference on, pp 176–183Google Scholar
  15. Guimerà R, Amaral LAN (2005) Cartography of complex networks: modules and universal roles. J Stat Mech 2005(02):P02001CrossRefGoogle Scholar
  16. Gusfield JR (1975) Community: a critical response. Harper & Row, New YorkGoogle Scholar
  17. Harary F (1969) Graph theory. Addison-Wesley Publishing Company, BostonGoogle Scholar
  18. Labatut V, Balasque J-M (2012) Detection and interpretation of communities in complex networks: practical methods and application. In: Abraham A, Hassanien A-E (eds) Computational social networks. Springer, London, pp 81–113CrossRefGoogle Scholar
  19. Labatut V, Balasque J-M (2013) Informative value of individual and relational data compared through business-oriented community detection. In: Özyer T, Rokne J, Wagner G, Reuser AH (eds) The influence of technology on social network analysis and mining. Lecture notes in social networks. Springer, Vienna, pp 303–330CrossRefGoogle Scholar
  20. Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4 Pt 2):046110CrossRefGoogle Scholar
  21. Lancichinetti A, Kivela M, Saramaki J, Fortunato S (2010) Characterizing the community structure of complex networks. PLoS One 5(8):e11976CrossRefGoogle Scholar
  22. Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web 1:5CrossRefGoogle Scholar
  23. Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2008) Statistical properties of community structure in large social and information networks. In: 17th international conference on World Wide Web, series statistical properties of community structure in large social and information networks, pp 695–704Google Scholar
  24. Li Z, Lu S, Myagmar S, Zhou Y (2006) Cp-miner: finding copy-paste and related bugs in large-scale software code. IEEE Trans Softw Eng 32(3):176–192CrossRefGoogle Scholar
  25. McMillan DW, Chavis DM (1986) Sense of community: a definition and theory. J Commun Psychol 14:6–23CrossRefGoogle Scholar
  26. Molloy M, Reed B (1995) A critical point for random graphs with a given degree sequence. Random Struct Algorithms 6(2/3):161–179MATHMathSciNetCrossRefGoogle Scholar
  27. Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167–256MATHMathSciNetCrossRefGoogle Scholar
  28. Orman GK (2014) Contribution to the interpretation of evolving communities in complex networks: application to the study of social interactions. Ph.D. thesis, INSA, LyonGoogle Scholar
  29. Orman GK, Labatut V (2010) The effect of network realism on community detection algorithms. In: ASONAM, series the effect of network realism on community detection algorithms, Odense, pp 301–305Google Scholar
  30. Parau P, Stef A, Lemnaru C, Dinsoreanu M, Potolea R (2013) Using community detection for sentiment analysis. In: Intelligent computer communication and processing (ICCP), 2013 IEEE international conference on, pp 51–54Google Scholar
  31. Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M (2001) Prefixspan: mining sequential patterns by prefix-projected growth. In: Proceedings of the 17th international conference on data engineering, IEEE Computer Society, Washington, DC, pp 215–224Google Scholar
  32. Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci USA 105(4):1118CrossRefGoogle Scholar
  33. Rousseeuw P (1987) Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J Comput Appl Math 20:53–65MATHCrossRefGoogle Scholar
  34. Sabidussi G (1966) The centrality index of a graph. Psychometrika 31(4):581–603MATHMathSciNetCrossRefGoogle Scholar
  35. Stattner E, Collard M (2012) Social-based conceptual links: conceptual analysis applied to social networks. In: Advances in social networks analysis and mining (ASONAM), 2012 IEEE/ACM international conference on, pp 25–29Google Scholar
  36. Tumminello M, Miccichè S, Lillo F, Varho J, Piilo J, Mantegna RN (2011) Community characterization of heterogeneous complex systems. J Stat Mech 2011(01):P01019CrossRefGoogle Scholar
  37. Watts DJ, Strogatz SH (1998) Collective dynamics of ’small-world’ networks. Nature 393(6684):440–442CrossRefGoogle Scholar
  38. Yan X, Han J, Afshar R (2003) Clospan: mining closed sequential patterns in large datasets. In: Proceedings 2003 international SIAM conference on data mining (SDM ’03), pp 166–177Google Scholar
  39. Yang J, McAuley J, Leskovec J (2013) Community detection in networks with node attributes. In: Data Mining (ICDM), 2013 IEEE 13th international conference on, pp 1151–1156Google Scholar
  40. Zaki MJ, Hsiao C-J (2002) Charm: an efficient algorithm for closed itemset mining. In: Grossman RL, Han J, Kumar V, Mannila H, Motwani R (eds) SDM. SIAM, ArlingtonGoogle Scholar
  41. Zhou Y, Cheng H, Yu J (2009) Graph clustering based on structural/attribute similarities. Proc VLDB Endow 2:718–729CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Wien 2015

Authors and Affiliations

  • Günce Keziban Orman
    • 1
  • Vincent Labatut
    • 2
  • Marc Plantevit
    • 3
  • Jean-François Boulicaut
    • 4
  1. 1.Department of Computer EngineeringGalatasaray UniversityIstanbulTurkey
  2. 2.Laboratoire Informatique d’AvignonUniversité d’AvignonAvignonFrance
  3. 3.Université Lyon 1, CNRS, LIRISVilleurbanneFrance
  4. 4.INSA-Lyon, CNRS, LIRISVilleurbanneFrance

Personalised recommendations