Skip to main content
Top

2017 | OriginalPaper | Chapter

Mining Recurrent Patterns in a Dynamic Attributed Graph

Authors : Zhi Cheng, Frédéric Flouvat, Nazha Selmaoui-Folcher

Published in: Advances in Knowledge Discovery and Data Mining

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

A great number of applications require to analyze a single attributed graph that changes over time. This task is particularly complex because both graph structure and attributes associated with each node can change. In the present work, we focus on the discovery of recurrent patterns in such a graph. These patterns are sequences of subgraphs which represent recurring evolutions of nodes w.r.t. their attributes. Various constraints have been defined and an original algorithm has been developed. Experiments performed on synthetic and real-world datasets have demonstrated the interest of our approach and its scalability.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Aggarwal, C.C., Wang, H. (eds.): Managing and Mining Graph Data, vol. 40. Springer, New York (2010)MATH Aggarwal, C.C., Wang, H. (eds.): Managing and Mining Graph Data, vol. 40. Springer, New York (2010)MATH
2.
go back to reference Ahmed, R., Karypis, G.: Algorithms for mining the coevolving relational motifs in dynamic networks. ACM (TKDD) 10(1), 4 (2015) Ahmed, R., Karypis, G.: Algorithms for mining the coevolving relational motifs in dynamic networks. ACM (TKDD) 10(1), 4 (2015)
3.
go back to reference Araujo, M., Günnemann, S., Papadimitriou, S., Faloutsos, C., Basu, P., Swami, A., Papalexakis, E.E., Koutra, D.: Discovery of “comet” communities in temporal and labeled graphs Com \(^{2}\). KaIS 46(3), 657–677 (2016) Araujo, M., Günnemann, S., Papadimitriou, S., Faloutsos, C., Basu, P., Swami, A., Papalexakis, E.E., Koutra, D.: Discovery of “comet” communities in temporal and labeled graphs Com \(^{2}\). KaIS 46(3), 657–677 (2016)
4.
go back to reference Berlingerio, M., Coscia, M., Giannotti, F., Monreale, A., Pedreschi, D.: Foundations of multidimensional network analysis. In: ASONAM 2011, pp. 485–489 (2011) Berlingerio, M., Coscia, M., Giannotti, F., Monreale, A., Pedreschi, D.: Foundations of multidimensional network analysis. In: ASONAM 2011, pp. 485–489 (2011)
5.
go back to reference Berlingerio, M., Bonchi, F., Bringmann, B., Gionis, A.: Mining graph evolution rules. In: Buntine, W., Grobelnik, M., Mladenić, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009. LNCS (LNAI), vol. 5781, pp. 115–130. Springer, Heidelberg (2009). doi:10.1007/978-3-642-04180-8_25 CrossRef Berlingerio, M., Bonchi, F., Bringmann, B., Gionis, A.: Mining graph evolution rules. In: Buntine, W., Grobelnik, M., Mladenić, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009. LNCS (LNAI), vol. 5781, pp. 115–130. Springer, Heidelberg (2009). doi:10.​1007/​978-3-642-04180-8_​25 CrossRef
6.
go back to reference Borgwardt, K.M., Kriegel, H., Wackersreuther, P.: Pattern mining in frequent dynamic subgraphs. In: ICDM 2006, pp. 818–822 (2006) Borgwardt, K.M., Kriegel, H., Wackersreuther, P.: Pattern mining in frequent dynamic subgraphs. In: ICDM 2006, pp. 818–822 (2006)
7.
go back to reference Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 858–863. Springer, Heidelberg (2008). doi:10.1007/978-3-540-68125-0_84 CrossRef Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 858–863. Springer, Heidelberg (2008). doi:10.​1007/​978-3-540-68125-0_​84 CrossRef
9.
go back to reference Desmier, E., Plantevit, M., Robardet, C., Boulicaut, J.-F.: Cohesive co-evolution patterns in dynamic attributed graphs. In: Ganascia, J.-G., Lenca, P., Petit, J.-M. (eds.) DS 2012. LNCS (LNAI), vol. 7569, pp. 110–124. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33492-4_11 CrossRef Desmier, E., Plantevit, M., Robardet, C., Boulicaut, J.-F.: Cohesive co-evolution patterns in dynamic attributed graphs. In: Ganascia, J.-G., Lenca, P., Petit, J.-M. (eds.) DS 2012. LNCS (LNAI), vol. 7569, pp. 110–124. Springer, Heidelberg (2012). doi:10.​1007/​978-3-642-33492-4_​11 CrossRef
10.
go back to reference Desmier, E., Plantevit, M., Robardet, C., Boulicaut, J.-F.: Trend mining in dynamic attributed graphs. In: Blockeel, H., Kersting, K., Nijssen, S., Železný, F. (eds.) ECML PKDD 2013. LNCS (LNAI), vol. 8188, pp. 654–669. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40988-2_42 CrossRef Desmier, E., Plantevit, M., Robardet, C., Boulicaut, J.-F.: Trend mining in dynamic attributed graphs. In: Blockeel, H., Kersting, K., Nijssen, S., Železný, F. (eds.) ECML PKDD 2013. LNCS (LNAI), vol. 8188, pp. 654–669. Springer, Heidelberg (2013). doi:10.​1007/​978-3-642-40988-2_​42 CrossRef
11.
go back to reference Fiedler, M., Borgelt, C.: Subgraph support in a single large graph. In: Workshops Proceedings of the 7th IEEE (ICDM 2007), pp. 399–404 (2007) Fiedler, M., Borgelt, C.: Subgraph support in a single large graph. In: Workshops Proceedings of the 7th IEEE (ICDM 2007), pp. 399–404 (2007)
12.
go back to reference Inokuchi, A., Washio, T.: FRISSMiner: mining frequent graph sequence patterns induced by vertices. IEICE Trans. 95–D(6), 1590–1602 (2012)CrossRef Inokuchi, A., Washio, T.: FRISSMiner: mining frequent graph sequence patterns induced by vertices. IEICE Trans. 95–D(6), 1590–1602 (2012)CrossRef
13.
go back to reference Kaytoue, M., Pitarch, Y., Plantevit, M., Robardet, C.: Triggering patterns of topology changes in dynamic graphs. In: ASONAM 2014, pp. 158–165 (2014) Kaytoue, M., Pitarch, Y., Plantevit, M., Robardet, C.: Triggering patterns of topology changes in dynamic graphs. In: ASONAM 2014, pp. 158–165 (2014)
14.
go back to reference Ozaki, T., Ohkawa, T.: Discovery of correlated sequential subgraphs from a sequence of graphs. In: Huang, R., Yang, Q., Pei, J., Gama, J., Meng, X., Li, X. (eds.) ADMA 2009. LNCS (LNAI), vol. 5678, pp. 265–276. Springer, Heidelberg (2009). doi:10.1007/978-3-642-03348-3_27 CrossRef Ozaki, T., Ohkawa, T.: Discovery of correlated sequential subgraphs from a sequence of graphs. In: Huang, R., Yang, Q., Pei, J., Gama, J., Meng, X., Li, X. (eds.) ADMA 2009. LNCS (LNAI), vol. 5678, pp. 265–276. Springer, Heidelberg (2009). doi:10.​1007/​978-3-642-03348-3_​27 CrossRef
15.
go back to reference Prakash, B.A., Vreeken, J., Faloutsos, C.: Efficiently spotting the starting points of an epidemic in a large graph. KaIS 38(1), 35–59 (2014) Prakash, B.A., Vreeken, J., Faloutsos, C.: Efficiently spotting the starting points of an epidemic in a large graph. KaIS 38(1), 35–59 (2014)
16.
go back to reference Robardet, C.: Constraint-based pattern mining in dynamic graphs. In: IEEE ICDM, pp. 950–955 (2009) Robardet, C.: Constraint-based pattern mining in dynamic graphs. In: IEEE ICDM, pp. 950–955 (2009)
17.
go back to reference Sanhes, J., Flouvat, F., Pasquier, C., Selmaoui-Folcher, N., Boulicaut, J.: Weighted path as a condensed pattern in a single attributed DAG. In: IJCAI 2013, pp. 1642–1648 (2013) Sanhes, J., Flouvat, F., Pasquier, C., Selmaoui-Folcher, N., Boulicaut, J.: Weighted path as a condensed pattern in a single attributed DAG. In: IJCAI 2013, pp. 1642–1648 (2013)
Metadata
Title
Mining Recurrent Patterns in a Dynamic Attributed Graph
Authors
Zhi Cheng
Frédéric Flouvat
Nazha Selmaoui-Folcher
Copyright Year
2017
DOI
https://doi.org/10.1007/978-3-319-57529-2_49

Premium Partner