Abstract
Sequential data mining is prevalent in many real world applications, such as gene sequence analysis, consumer shopping log analysis, social networking analysis, and banking transaction analysis. Contrast sequence data mining is useful in describing the differences between two sets (classes) of sequences. However, in prior studies, little work has been done in how to mine the patterns from sequences formed by associated temporal events, where there exist relationships in chronological order between any two events in a sequence. To fill this gap, we consider the problem of mining associated temporal relationship pattern (ATRP) and propose a method, called ATTEND (AssociaTed Temporal rElationship patterN Discovery), to discover ATRPs with top contrast measure from two sets of associative temporal event sequences. Moreover, we design several heuristic strategies to improve the efficiency of ATTEND. Experiments on both real and synthetic data demonstrate that ATTEND is effective and efficient.
This work was supported in part by NSFC 61572332, the Fundamental Research Funds for the Central Universities 2016SCU04A22, and the China Postdoctoral Science Foundation 2016T90850.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Yang, H., Duan, L., Dong, G., Nummenmaa, J., Tang, C., Li, X.: Mining itemset-based distinguishing sequential patterns with gap constraint. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9049, pp. 39–54. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18120-2_3
Wang, X., Duan, L., Dong, G., Yu, Z., Tang, C.: Efficient mining of density-aware distinguishing sequential patterns with gap constraints. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds.) DASFAA 2014. LNCS, vol. 8421, pp. 372–387. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-05810-8_25
Srikant, R., Agrawal, R.: Mining sequential patterns: generalizations and performance improvements. In: Apers, P., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 1–17. Springer, Berlin (1996). https://doi.org/10.1007/BFb0014140
Zaki, M.J.: SPADE: an efficient algorithm for mining frequent sequences. Mach. Learn. 42(1/2), 31–60 (2001)
Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 429–435 (2002)
Dong, G., Pei, J.: Sequence Data Mining. Advance in Database System, vol. 33. Springer, Boston (2007). https://doi.org/10.1007/978-0-387-69937-0
Duan, L., et al.: Mining distinguishing customer focus sets from online customer reviews. Computing 100(4), 335–351 (2018)
Zheng, Z., Wei, W., Liu, C., Cao, W., Cao, L., Bhatia, M.: An effective contrast sequential pattern mining approach to taxpayer behavior analysis. World Wide Web 19(4), 633–651 (2016)
Zhao, Y., Wang, G., Li, Y., Wang, Z.: Finding novel diagnostic gene patterns based on interesting non-redundant contrast sequence rules. In: Proceedings of the 11th IEEE International Conference on Data Mining, pp. 972–981 (2011)
Zhu, J., Wang, K., Wu, Y., Hu, Z., Wang, H.: Mining user-aware rare sequential topic patterns in document streams. IEEE Trans. Knowl. Data Eng. 28(7), 1790–1804 (2016)
Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)
Papapetrou, P., Kollios, G., Sclaroff, S., Gunopulos, D.: Discovering frequent arrangements of temporal intervals. In: Proceedings of the 5th IEEE International Conference on Data Mining, pp. 354–361 (2005)
Winarko, E., Roddick, J.F.: ARMADA - an algorithm for discovering richer relative temporal association rules from interval-based data. Data Knowl. Eng. 63(1), 76–90 (2007)
Hui, L., Chen, Y., Weng, J.T., Lee, S.: Incremental mining of temporal patterns in interval-based database. Knowl. Inf. Syst. 46(2), 423–448 (2016)
Yang, C., Jaysawal, B.P., Huang, J.: Subsequence search considering duration and relations of events in time interval-based events sequences. In: Proceedings of 2017 IEEE International Conference on Data Science and Advanced Analytics, pp. 293–302 (2017)
Patel, D., Hsu, W., Lee, M.: Mining relationships among interval-based events for classification. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 393–404 (2008)
Mörchen, F., Ultsch, A.: Efficient mining of understandable patterns from multivariate interval time series. Data Min. Knowl. Discov. 15(2), 181–215 (2007)
Tang, L., Li, T., Shwartz, L.: Discovering lag intervals for temporal dependencies. In: Proceedings of the 18th ACM International Conference on Knowledge Discovery and Data Mining, 633–641 (2012)
Duan, L., Yan, L., Dong, G., Nummenmaa, J., Yang, H.: Mining top-k distinguishing temporal sequential patterns from event sequences. In: Candan, S., Chen, L., Pedersen, T.B., Chang, L., Hua, W. (eds.) DASFAA 2017. LNCS, vol. 10178, pp. 235–250. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-55699-4_15
Rymon, R.: Search through systematic set enumeration. In: Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, KR, pp. 539–550 (1992)
Lichman, M.: UCI machine learning repository (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Han, C., Duan, L., Lin, Z., Qin, R., Zhang, P., Nummenmaa, J. (2019). Discovering Relationship Patterns Among Associated Temporal Event Sequences. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds) Database Systems for Advanced Applications. DASFAA 2019. Lecture Notes in Computer Science(), vol 11446. Springer, Cham. https://doi.org/10.1007/978-3-030-18576-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-18576-3_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18575-6
Online ISBN: 978-3-030-18576-3
eBook Packages: Computer ScienceComputer Science (R0)