- 期刊
Updating the Sequential Patterns in Dynamic Databases for Customer Sequences Deletion
並列摘要
In the past, an FUSP-tree algorithm for inserting customer sequences was proposed for handling the customer sequences insertion. In this paper, the FUSPtree construction algorithm is thus modified for efficiently handling the deletion of customer sequences. A decremental FUSP-tree algorithm for sequences deletion (FUSPDEL) is thus proposed for reducing the execution time of re-constructing the tree while the customer sequences are deleted in the original database. Experimental results show that the proposed FUSP-DEL algorithm has a good performance in both of the time and space complexity.
延伸閱讀
- Chiu, P. H. (2008). Discovering Time-Interval Hybrid Temporal Patterns in Sequence Database [master's thesis, National Central University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0031-0207200917353100
- Shieh, Y. C. (2006). Applying Sequential Pattern Mining Technologies for Behavior Change Detection [master's thesis, Yuan Ze University]. Airiti Library. https://doi.org/10.6838/YZU.2006.00232
- 陳櫻芳（2002）。Pattern-Oriented Clustering Methods For Sequences〔碩士論文，元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611363335
- Lee, T. Y. (2007). Mining Closed Patterns in Multi-sequence Time-series Databases [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2007.00920
- Lin, M. Y., & Lee, S. Y. (2005). Fast Discovery of Sequential Patterns through Memory Indexing and Database Partitioning. Journal of Information Science and Engineering, 21(1), 109-128. https://doi.org/10.6688/JISE.2005.21.1.6