Abstract
In this paper we present the Dual Support Apriori for Temporal data (DSAT) algorithm. This is a novel technique for discovering Jumping Emerging Patterns (JEPs) from time series data using a sliding window technique. Our approach is particularly effective when performing trend analysis in order to explore the itemset variations over time. Our proposed framework is different from the previous work on JEP in that we do not rely on itemsets borders with a constrained search space. DSAT exploits previously mined time stamped data by using a sliding window concept, thus requiring less memory, minimum computational cost and very low dataset accesses. DSAT discovers all JEPs, as in “naïve” approaches, but utilises less memory and scales linearly with large datasets sets as demonstrated in the experimental section.
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
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R. & Srikant, R., 1994. Fast algorithms for mining association rules. In Proc. 20th Int. Conf. Very Large Data Bases, VLDB. 487-499.
Li, H.F. & Lee, S.Y., 2009. Mining frequent itemsets over data streams using efficient window sliding techniques. Expert Systems with Applications, 36(2P1), 1466-1477.
Lee, C.H., Chen, M.S. & Lin, C.R., 2003. Progressive partition miner: An efficient algorithm for mining general temporal association rules. IEEE Transactions on Knowledge and Data Engineering, 1004-1017.
Chang, J.H. & Lee, W.S., 2004. A sliding window method for finding recently frequent itemsets over online data streams. Journal of Information Science and Engineering, 20(4), 753-762.
Jiang, N., 2006. Research issues in data stream association rule mining. ACM Sigmod Record, 35(1), 14-19.
Imberman, S.P. and Tansel, A.U. and Pacuit, E., 2004 An Efficient Method For Finding Emerging Frequent Itemsets,3rd International Workshop on Mining Temporal and Sequential Data, 112-121.
Bailey, J., Manoukian, T. & Ramamohanarao, K., 2002. Fast algorithms for mining emerging patterns. Lecture notes in computer science, 39-50.
Dong, G. & Li, J., 1999. Efficient mining of emerging patterns: Discovering trends and differences. In Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM New York, NY, USA, pp. 43-52.
Rioult, F., Mining strong emerging patterns in wide SAGE data. In Proceedings of the ECML/PKDD Discovery Challenge Workshop. Citeseer, pp. 484-487.
Grandinetti, W.M., Chesnevar, C.I. & Falappa, M.A., 2005. Enhanced Approximation of the Emerging Pattern Space using an Incremental Approach, Proceedings of VII Workshop of Researchers in Computer Sciences, Argentine, 263-267
Coenen, F., Leng, P. & Ahmed, S., 2004. Data structure for association rule mining: T-trees and P-trees. IEEE Transactions on Knowledge and Data Engineering, 774-778.
M. Sulaiman Khan, Muyeba, M., Tjortjis, C. & Coenen, F., 2007. An Effective Fuzzy Healthy Association Rule Mining Algorithm (FHARM). In Proc. 7th Annual Workshop on Computational Intelligence UKCI 2007.
IBM Synthetic Data Generator, http://www.almaden.ibm.com/software/quest/resources/index.html
Server Logs data set is the courtesy of LearnHigher: http://www.learnhigher.ac.uk
Point of Sale data is provided by a News Agent/Grocery Store in Walsall
Freight forwarding enterprise data is provided by Transglobal Express Service http://www.transglobalexpress.co.uk
Cremilleux, B., Soulet, A. & Rioult, F., 2003. Mining the strongest emerging patterns characterizing patients affected by diseases due to atherosclerosis. In proceedings of the workshop Discovery Challenge, PKDD’03. 59-70.
Tseng, V. S., Chu, C.J. & Tyne Liang, 2006. An Efficient Method for Mining Temporal Emerging Itemsets From Data Streams. International Computer Symposium, Workshop on Software Engineering, Databases and Knowledge Discovery.
Bayardo Jr, R.J., 1998. Efficiently mining long patterns from databases. ACM SIGMOD Record, 27(2), 85-93.
Kapasi, U.J. et al., 2003. Programmable stream processors. Computer, 54-62.
M. Sulaiman Khan, Muyeba, M. & Coenen, F., 2009. Effective Mining of Weighted Fuzzy Association Rules, Rare Association Rule Mining and Knowledge Discovery: Technologies for Infrequent and Critical Event Detection, Advances in Data Warehousing and Mining (ADWM) Book Series, IGI Global. ISBN: 978-1-60566-754-6, 47-64.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag London
About this paper
Cite this paper
Khan, M.S., Coenen, F., Reid, D., Patel, R., Archer, L. (2010). A Sliding Windows based Dual Support Framework for Discovering Emerging Trends from Temporal Data. In: Bramer, M., Ellis, R., Petridis, M. (eds) Research and Development in Intelligent Systems XXVI. Springer, London. https://doi.org/10.1007/978-1-84882-983-1_3
Download citation
DOI: https://doi.org/10.1007/978-1-84882-983-1_3
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84882-982-4
Online ISBN: 978-1-84882-983-1
eBook Packages: Computer ScienceComputer Science (R0)