Abstract
Among various data mining techniques, sequential-pattern mining is used to discover the frequent subsequences from a sequence database. Most research handles the static database in batch mode to discover the desired sequential patterns. Transactions or customer sequences are, however, dynamically changed in real-world applications. In the past, the FUSP tree was designed to maintain and update the discovered information based on Fast UPdated (FUP) approach with sequence insertion and sequence deletion. The original customer sequences is still required to be rescanned if it is necessary. In this paper, the prelarge concept is adopted to maintain and update the built FUSP tree with sequence deletion. When the number of deleted customers is smaller than the safety bound of the prelarge concept, the original database is unnecessary to be rescanned but the sequential patterns can still be actually maintained and updated. Experiments are also conducted to show the performance of the proposed algorithm in terms of execution time and number of tree nodes.
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
A Sequential Pattern Mining Framework (2010), http://www.philippe-fournier-viger.com/spmf/index.php
Agrawal, R., Imielinski, T., Swami, A.: Database Mining: A Performance Perspective. IEEE Transactions on Knowledge and Data Engineering 5, 914–925 (1993)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: The International Conference on Very Large Data Bases, pp. 487–499 (1994)
Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: The International Conference on Data Engineering, pp. 3–14 (1995)
Bodon, F.: A Fast Apriori Implementation. In: IEEE ICDM Workshop on Frequent Itemset Mining Implementations (2003)
Chen, M.S., Han, J., Yu, P.S.: Data Mining: An Overview from a Database Perspective. IEEE Transactions on Knowledge and Data Engineering 8, 866–883 (1996)
Cheung, D.W., Han, J., Ng, V., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In: International Conference on Data Engineering, pp. 106–114 (1996)
Cheung, D.W., Lee, S.D., Kao, B.: A General Incremental Technique for Maintaining Discovered Association Rules. In: The International Conference on Database Systems for Advanced Applications, pp. 185–194 (1997)
Guyet, T., Quiniou, R.: Extracting Temporal Patterns from Interval-Based Sequences. In: The International Joint Conference on Artificial Intelligence, pp. 1306–1311 (2011)
Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Mining and Knowledge Discovery 8, 53–87 (2004)
Hong, T.P., Wang, C.Y., Tao, Y.H.: A New Incremental Data Mining Algorithm using Pre-large Itemsets. Intelligent Data Analysis 5, 111–129 (2001)
Hong, T.P., Lin, C.W., Wu, Y.L.: Incrementally Fast Updated Frequent Pattern Trees. Expert Systems with Applications 34, 2424–2435 (2008)
Hong, T.P., Wang, C.Y., Tseng, S.S.: An Incremental Mining Algorithm for Maintaining Sequential Patterns using Pre-large Sequences. Expert Systems with Applications 38, 7051–7058 (2011)
Kim, C., Lim, J.H., Ng, R.T., Shim, K.: Squire: Sequential Pattern Mining with Quantities. Journal of Systems and Software 80, 1726–1745 (2007)
Lin, C.W., Hong, T.P., Lu, W.H., Lin, W.Y.: An Incremental FUSP-Tree Maintenance Algorithm. In: The International Conference on Intelligent Systems Design and Applications, pp. 445–449 (2008)
Lin, C.W., Hong, T.P., Lu, W.H.: An Efficient FUSP-Tree Update Algorithm for Deleted Data in Customer Sequences. In: International Conference on Innovative Computing, Information and Control, pp. 1491–1494 (2009)
Lin, M.Y., Lee, S.Y.: Incremental Update on Sequential Patterns in Large Databases. In: IEEE International Conference on Tools with Artificial Intelligence, pp. 24–31 (1998)
Mooney, C.H., Roddick, J.F.: Sequential Pattern Mining - Approaches and Algorithms. ACM Computing Surveys 45, 1–39 (2013)
Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M.C.: Mining Sequential Patterns by Pattern-Growth: the PrefixSpan Approach. IEEE Transactions on Knowledge and Data Engineering 16, 1424–1440 (2004)
Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 3–17. Springer, Heidelberg (1996)
Wang, C.Y., Hong, T.P., Tseng, S.S.: Maintenance of Sequential Patterns for Record Deletion. In: IEEE International Conference on Data Mining, pp. 536–541 (2001)
Zaki, M.J.: SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning 42, 31–60 (2001)
Zheng, Z., Kohavi, R., Mason, L.: Real World Performance of Association Rule Algorithms. In: ACM International Conference on Knowledge Discovery and Data Mining, pp. 401–406 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, CW., Gan, W., Hong, TP., Pan, JS. (2014). Updating the Built FUSP Trees with Sequence Deletion Based on Prelarge Concept. In: Wang, L.SL., June, J.J., Lee, CH., Okuhara, K., Yang, HC. (eds) Multidisciplinary Social Networks Research. MISNC 2014. Communications in Computer and Information Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45071-0_34
Download citation
DOI: https://doi.org/10.1007/978-3-662-45071-0_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45070-3
Online ISBN: 978-3-662-45071-0
eBook Packages: Computer ScienceComputer Science (R0)