Abstract
A dynamic attributed graph is a graph that changes over time and where each vertex is described using multiple continuous attributes. Such graphs are found in numerous domains, e.g., social network analysis. Several studies have been done on discovering patterns in dynamic attributed graphs to reveal how attribute(s) change over time. However, many algorithms restrict all attribute values in a pattern to follow the same trend (e.g. increase) and the set of vertices in a pattern to be fixed, while others consider that a single vertex may influence its neighbors. As a result, these algorithms are unable to find complex patterns that show the influence of multiple vertices on many other vertices in terms of several attributes and different trends. This paper addresses this issue by proposing to discover a novel type of patterns called attribute evolution rules (AER). These rules indicate how changes of attribute values of multiple vertices may influence those of others with a high confidence. An efficient algorithm named AER-Miner is proposed to find these rules. Experiments on real data show AER-Miner is efficient and that AERs can provide interesting insights about dynamic attributed graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
It was observed using computer simulations that the number of connected labeled graphs with \(v = 2, 3, 4, 5, 6, 7\), and 8 nodes is 1, 4, 38, 728, 26,704, 1,866,256, and 251,548,592, respectively (https://oeis.org/A001187).
References
Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference Very Large Data Bases, VLDB, vol. 1215, pp. 487–499 (1994)
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). https://doi.org/10.1007/978-3-642-04180-8_25
Borgwardt, K., Kriegel, H., Wackersreuther, P.: Pattern mining in frequent dynamic subgraphs. In: Proceedings of the 6th IEEE International Conference on Data Mining, pp. 1818–822 (2006)
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). https://doi.org/10.1007/978-3-540-68125-0_84
Cheng, Z., Flouvat, F., Selmaoui-Folcher, N.: Mining recurrent patterns in a dynamic attributed graph. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10235, pp. 631–643. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57529-2_49
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). https://doi.org/10.1007/978-3-642-33492-4_11
Fournier-Viger, P., Cheng, C., Cheng, Z.X., Lin, J.C.W., Selmaoui-Folcher, N.: Mining significant trend sequences in dynamic attributed graphs. Knowl. Based Syst. 182(15), 1–25 (2019)
Fournier-Viger, P., et al.: A survey of pattern mining in dynamic graphs. WIREs Data Mining Knowl. Discov. e1372. https://doi.org/10.1002/widm.1372
Jin, R., McCallen, S., Almaas, E.: Trend motif: a graph mining approach for analysis of dynamic complex networks. In: Proceedings of the 7th IEEE International Conference on Data Mining, pp. 541–546. IEEE (2007)
Kaytoue-Uberall, M., Pitarch, Y., Plantevit, M., Robardet, C.: Triggering patterns of topology changes in dynamic graphs. In: 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 158–165 (2014)
Lenca, P., Vaillant, B., Meyer, P., Lallich, S.: Association rule interestingness measures: experimental and theoretical studies. In: Guillet, F.J., Hamilton, H.J. (eds.) Quality Measures in Data Mining. SCI, vol. 43, pp. 51–76. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-44918-8_3
Leung, C.W., Lim, E., Lo, D., Weng, J.: Mining interesting link formation rules in social networks. In: Proceedings of the 19th ACM Conference on Information and Knowledge Management, pp. 209–218 (2010)
Ozaki, T., Etoh, M.: Correlation and contrast link formation patterns in a time evolving graph. In: Proceedings of the Workshops of 11th IEEE International Conference on Data Mining, pp. 1147–1154 (2011)
Scharwächter, E., Müller, E., Donges, J.F., Hassani, M., Seidl, T.: Detecting change processes in dynamic networks by frequent graph evolution rule mining. In: Proceedings of the 16th IEEE International Conference on Data Mining, pp. 1191–1196 (2016)
Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, pp. 721–724 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Fournier-Viger, P., He, G., Lin, J.CW., Gomes, H.M. (2020). Mining Attribute Evolution Rules in Dynamic Attributed Graphs. In: Song, M., Song, IY., Kotsis, G., Tjoa, A.M., Khalil, I. (eds) Big Data Analytics and Knowledge Discovery. DaWaK 2020. Lecture Notes in Computer Science(), vol 12393. Springer, Cham. https://doi.org/10.1007/978-3-030-59065-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-59065-9_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-59064-2
Online ISBN: 978-3-030-59065-9
eBook Packages: Computer ScienceComputer Science (R0)