Abstract
Mining Temporal Patterns from temporal databases is challenging as it requires handling efficient database scan. A pattern is temporally similar when it satisfies subset constraints. The naive and apriori algorithm designed for non-temporal databases cannot be extended to find similar temporal patterns from temporal databases. The brute force approach requires computing \(2^n\) true support combinations for ānā items from finite item set and falls in NP-class. The apriori or fp-tree based approaches are not directly extendable to temporal databases to obtain similar temporal patterns. In this present research, we come up with novel approach to discover temporal association patterns which are similar for pre-specified subset constraints, and substantially reduce support computations by defining expressions to estimate support bounds. The proposed approach eliminates computational overhead in finding similar temporal patterns. The results prove that the proposed method outperforms brute force approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Jin, L., Lee, Y., Seo, S., Ryu, K.H.: Discovery of temporal frequent patterns using TFP-tree. In: Yu, J.X., Kitsuregawa, M., Leong, H.V. (eds.) WAIM 2006. LNCS, vol. 4016, pp. 349ā361. Springer, Heidelberg (2006). doi:10.1007/11775300_30
Hirano, S., Tsumoto, S.: Mining similar temporal patterns in long time-series data and its application to medicine. In: Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 2003, pp. 219ā226 (2002)
Yoo, J.S., Shekhar, S.: Similarity-profiled temporal association mining. IEEE Trans. Knowl. Data Eng. 21(8), 1147ā1161 (2009)
Chen, Y.C., Peng, W.C., Lee, S.Y.: Mining temporal patterns in time interval-based data. IEEE Trans. Knowl. Data Eng. 27(12), 3318ā3331 (2015)
Yoo, J.S., Shekhar, S.: Mining temporal association patterns under a similarity constraint. In: LudƤscher, B., Mamoulis, N. (eds.) SSDBM 2008. LNCS, vol. 5069, pp. 401ā417. Springer, Heidelberg (2008). doi:10.1007/978-3-540-69497-7_26
Yoo, J.S.: Temporal data mining: similarity-profiled association pattern. Data Mining: Foundations and Intelligent Paradigms. Intelligent Systems Reference Library, vol. 23, pp 29ā47 (2012)
Radhakrishna, V., Kumar, P.V., Janaki, V.: A Survey on temporal databases and data mining. In: Proceedings of the International Conference on Engineering & MIS 2015 (ICEMIS 2015), Article 52, 6 pages. ACM, New York (2015). doi:10.1145/2832987.2833064
Radhakrishna, V., Kumar, P.V., Janaki, V.: A novel approach for mining similarity profiled temporal association patterns using venn diagrams. In: Proceedings of the International Conference on Engineering & MIS 2015 (ICEMIS 2015), Article 58, 9 pages. ACM, New York (2015). doi:10.1145/2832987.2833071
Radhakrishna, V., Kumar, P.V., Janaki, V.: An approach for mining similarity profiled temporal association patterns using gaussian based dissimilarity measure. In: Proceedings of the International Conference on Engineering & MIS 2015 (ICEMIS 2015), Article 57, 6 pages. ACM, New York (2015). doi:10.1145/2832987.2833069
Radhakrishna, V., Kumar, P.V., Janaki, V.: A novel approach for mining similarity profiled temporal association patterns. Rev. TĆ©c. Ing. Univ. Zulia. 38(3), 80ā93 (2015)
Calders, T.: Deducing bounds on the support of itemsets. In: Meo, R., Lanzi, P.L., Klemettinen, M. (eds.) Database Support for Data Mining Applications. LNCS (LNAI), vol. 2682, pp. 214ā233. Springer, Heidelberg (2004). doi:10.1007/978-3-540-44497-8_11
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2017 Springer International Publishing AG
About this paper
Cite this paper
Radhakrishna, V., Kumar, P.V., Janaki, V., Rajasekhar, N. (2017). Estimating Prevalence Bounds of Temporal Association Patterns to Discover Temporally Similar Patterns. In: MatouŔek, R. (eds) Recent Advances in Soft Computing. ICSC-MENDEL 2016. Advances in Intelligent Systems and Computing, vol 576. Springer, Cham. https://doi.org/10.1007/978-3-319-58088-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-58088-3_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-58087-6
Online ISBN: 978-3-319-58088-3
eBook Packages: EngineeringEngineering (R0)