What effects topological changes in dynamic graphs?

Elucidating relationships between vertex attributes and the graph structure
  • Mehdi Kaytoue
  • Yoann Pitarch
  • Marc Plantevit
  • Céline Robardet
Original Article


To describe the dynamics taking place in networks that structurally change over time, we propose an approach to search for vertex attributes whose value changes impact the topology of the graph. In several applications, it appears that the variations of a group of attributes are often followed by some structural changes in the graph that one may assume they generate. We formalize the triggering pattern discovery problem as a method jointly rooted in sequence mining and graph analysis. We apply our approach on three real-world dynamic graphs of different natures—a co-authoring network, an airline network, and a social bookmarking system—assessing the relevancy of the triggering pattern mining approach.


Data mining Mining methods and analysis Attributed graph mining Topological patterns Dynamic graphs 



This work has been partially supported by the project GRAISearch—EU Marie Curie Actions—FP7-PEOPLE-2013-IAPP.


  1. Ahmed R, Karypis G (2011) Algorithms for mining the evolution of conserved relational states in dynamic networks. In: ICDM, IEEE, pp 1–10Google Scholar
  2. Berlingerio M, Bonchi F, Bringmann B, Gionis A (2009) Mining graph evolution rules. In: ECML/PKDD, pp 115–130Google Scholar
  3. Borgwardt KM, Kriegel H-P, Wackersreuther P (2006) Pattern mining in frequent dynamic subgraphs. In: ICDM, IEEE, pp 818–822Google Scholar
  4. Bringmann B, Berlingerio M, Bonchi F, Gionis A (2010) Learning and predicting the evolution of social networks. IEEE Intell Syst 25(4):26–35CrossRefGoogle Scholar
  5. Cantador I, Brusilovsky P, Kuflik T (2011) Information heterogeneity and fusion in recommender systems. In: RecSys, ACMGoogle Scholar
  6. Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press, CambridgeMATHGoogle Scholar
  7. de Melo POV, Faloutsos C, Loureiro AAF (2011) Human dynamics in large communication networks. In: SDM, SIAM, pp 968–879Google Scholar
  8. Desmier E, Plantevit M, Robardet C, Boulicaut J-F (2013) Trend mining in dynamic attributed graphs. In: ECML/PKDD, pp 654–669Google Scholar
  9. Dong G, Li J (1999) Efficient mining of emerging patterns: discovering trends and differences. In: KDD, pp 43–52Google Scholar
  10. Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35–41CrossRefGoogle Scholar
  11. Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826MathSciNetCrossRefMATHGoogle Scholar
  12. Goyal A, Bonchi F, Lakshmanan LVS, Venkatasubramanian S (2013) On minimizing budget and time in influence propagation over social networks. Soc Netw Anal Min 3(2):179–192CrossRefGoogle Scholar
  13. Günnemann S, et al (2010) Subspace clustering meets dense subgraph mining: a synthesis of two paradigms. In: ICDM, pp 845–850Google Scholar
  14. Inokuchi A, Washio T (2010) Mining frequent graph sequence patterns induced by vertices. In: SDM, SIAM, p 466–477Google Scholar
  15. Jiang M, Cui P, Liu R, Yang Q, Wang F, Zhu W, Yang S (2012) Social contextual recommendation. In: CIKM, pp 45–54Google Scholar
  16. Khan A, Yan X, Wu K-L (2010) Towards proximity pattern mining in large graphs. In: SIGMOD, ACM, pp 867–878Google Scholar
  17. Lahiri M, Berger-Wolf TY (2008) Mining periodic behavior in dynamic social networks. In: ICDM, IEEE, pp 373–382Google Scholar
  18. Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2008) Statistical properties of community structure in large social and information networks. In: WWW, ACM, pp 695–704Google Scholar
  19. Leskovec J, Sosič R (2014) SNAP: a general purpose network analysis and graph mining library in C++. http://snap.stanford.edu/snap
  20. Moser F, Colak R, Rafiey A, Ester M (2009) Mining cohesive patterns from graphs with feature vectors. In: SDM, SIAM, pp 593–604Google Scholar
  21. Mougel PN, Rigotti C, Plantevit M, Gandrillon O (2014) Finding maximal homogeneous clique sets. Knowl Inf Syst 35(1):1–30Google Scholar
  22. Ng RT, Lakshmanan LVS, Han J, Pang A (1998) Exploratory mining and pruning optimizations of constrained association rules. In: Haas LM, Tiwary A (eds) SIGMOD 1998, Proceedings ACM SIGMOD international conference on management of data, June 2–4, 1998, Seattle, Washington, USA, ACM Press, pp 13–24Google Scholar
  23. Nguyen K-N, Cerf L, Plantevit M, Boulicaut J-F (2013) Discovering descriptive rules in relational dynamic graphs. Intell Data Anal 17(1):49–69Google Scholar
  24. Novak PK, Lavrač N, Webb GI (2009) Supervised descriptive rule discovery: a unifying survey of contrast set, emerging pattern and subgroup mining. J Mach Learn Res 10:377–403MATHGoogle Scholar
  25. Plantevit M, Crémilleux B (2009) Condensed representation of sequential patterns according to frequency-based measures. In: Adv. in intelligent data analysis, LNCS, vol. 5772, Springer, Heidelberg, pp 155–166Google Scholar
  26. Prado A, Jeudy B, Fromont É, Diot F (2013) Mining spatiotemporal patterns in dynamic plane graphs. Intell Data Anal 17(1):71–92Google Scholar
  27. Prado A, Plantevit M, Robardet C, Boulicaut J-F (2012) Mining graph topological patterns: finding co-variations among vertex descriptors. IEEE TKDE 99:1Google Scholar
  28. Robardet C (2009) Constraint-based pattern mining in dynamic graphs. In: ICDM, IEEE, pp 950–955Google Scholar
  29. Sese J, Seki M, Fukuzaki M (2010) Mining networks with shared items. In: CIKM, ACM, pp 1681–1684Google Scholar
  30. Silva A, Meira W, Zaki MJ (2012) Mining attribute-structure correlated patterns in large attributed graphs. PVLDB 5(5):466–477Google Scholar
  31. Tong H, Papadimitriou S, Sun J, Yu PS, Faloutsos C (2008) Colibri: fast mining of large static and dynamic graphs. In: KDDGoogle Scholar
  32. Yan X, Han J, Afshar R (2003) Clospan: mining closed sequential patterns in large databases. In: SDM, SIAM, pp 166–177Google Scholar
  33. Yang Y, Yu J, Gao H, Pei J, Li J (2013) Mining most frequently changing component in evolving graphs. WWW, pp 1–26Google Scholar
  34. You CH, Holder LB, Cook DJ (2009) Learning patterns in the dynamics of biological networks. In: KDD, pp 977–986Google Scholar
  35. Zaki MJ, Hsiao CJ (2002) Charm: an efficient algorithm for closed itemset mining. In: SDM, SIAMGoogle Scholar
  36. Zhang Q, Song X, Shao X, Zhao H, Shibasaki R (2014) Attributed graph mining and matching: an attempt to define and extract soft attributed patterns. In: CVPR, pp 1394–1401Google Scholar
  37. Zhou Y, Cheng H, Yu JX (2009) Graph clustering based on structural/attribute similarities. Proc VLDB Endow 2(1):718–729CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Wien 2015

Authors and Affiliations

  • Mehdi Kaytoue
    • 1
  • Yoann Pitarch
    • 2
  • Marc Plantevit
    • 3
  • Céline Robardet
    • 1
  1. 1.INSA-Lyon, CNRS, LIRIS UMR5205Villeurbanne CedexFrance
  2. 2.Université de Toulouse, CNRS, IRIT UMR5505ToulouseFrance
  3. 3.Université Claude Bernard Lyon 1, CNRS, LIRIS UMR5205Villeurbanne CedexFrance

Personalised recommendations