Efficient algorithms for mining and incremental update of maximal frequent sequences

Data Mining and Knowledge Discovery

Volumn 10, Issue 2, 2005, Pages 87-116

  Kao, Ben ^a   Zhang, Minghua ^a   Yip, Chi Lap ^a   Cheung, David W ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Data mining; Incremental update; Sequence

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATABASE SYSTEMS;

FREQUENT SEQUENCES; GSP; INCREMENTAL UPDATE; TRANSACTIONAL DATABASE;

DATA MINING;

EID: 24044460806     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-005-0268-z     Document Type: Article

References (21)

1. Agrawal, R., Imielinski, T., and Swami, A.N. 1993. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD International Conference on Management of Data, Washington, D.C., pp. 207-216.
2. Agrawal, R. and Srikant, R. 1995. Mining sequential patterns. In Proc. of the 11th Int'l Conference on Data Engineering. Taipei, Taiwan, pp. 3-14.
3. Ayan, N.F., Tansel, A.U., and Arkun, E. 1999. An efficient algorithm to update large itemsets with early pruning. In Proc. 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. San Diego, CA, USA, pp. 287-291.
4. Cheung, D.W., Han, J., Ng, V., and Wong, C.Y. 1996a. Maintenance of discovered association rules in large databases: An incremental updating techniques. In Proc. 12th IEEE International Conference on Data Engineering (ICDE). New Orleans, Louisiana, USA, pp. 106-114.
5. Cheung, D.W., Lee, S.D., and Kao, B. 1997. A general incremental technique for maintaining discovered association rules. In Proc. International Conference on Database Systems for Advanced Applications (DASFAA). Melbourne, Australia, pp. 185-194.
6. Cheung, D.W., Ng, V., and Tarn, B.W. 1996b. Maintenance of discovered knowledge: A case in multi-level association rules. In Proc. Second International Conference on Knowledge Discovery and Data Mining (KDD). Portland, Oregon, pp. 307-310.
7. Garofalakis, M.N., Rastogi, R., and Shim, K. 1999. SPIRIT: Sequential pattern mining with regular expression constraints. In Proceedings of the 25th International Conference on Very Large Data Bases. Edinburgh, Scotland, UK, pp. 223-234.
8. ibm. http://www.almaden.ibm.com/cs/quest/.
9. Lee, S., Cheung, D.W., and Kao, B. 1998. Is sampling useful in data mining? a case in the maintenance of discovered association rules. Data Mining and Knowledge Discovery, 2:233-262.
10. Lee, S.D. and Cheung, D.W. 1997. Maintenance of discovered association rules: When to update? In Proc. 1997 ACM-SIGMOD Workshop on Data Mining and Knowledge Discovery (DMKD). Tucson, Arizona.
11. Omiecinski, E. and Savasere, A. 1998. Efficient mining of association rules in large dynamic databases. In Proc. BNCOD'98, pp. 49-63.
12. Parthasarathy, S., Zaki, M.J., Ogihara, M., and Dwarkadas, S. 1999. Incremental and interactive sequence mining. In Proceedings of the 1999 ACM 8th International Conference on Information and Knowledge Management (CIKM'99). Kansas City, MO USA, pp. 251-258.
13. Pel, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., and Hsu, M.-C. 2001. Prefixspan: Mining sequential patterns by prefix-projected growth. In Proc. 17th IEEE International Conference on Data Engineering (ICDE). Heidelberg, Germany, pp. 215-224.
14. Provost, F., Jensen, D., and Gates, T. 1999. Efficient progressive sampling. In Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining. San Diego CA, USA, pp. 23-32.
15. Sarda, N.L. and Srinivas, N.V. 1998. An adaptive algorithm for incremental mining of association rules. In Proc. DEXA Workshop'98, pp. 240-245.
16. Srikant, R. and Agrawal, R. 1996. Mining sequential patterns: Generalizations and performance improvements. In Proc. of the 5th Conference on Extending Database Technology (EDBT). Avignion, France, pp. 3-17.
17. Thomas, S., Bodagala, S., Alsabti, K., and Ranka, S. 1997. An efficient algorithm for the incremental updation of association rules in large databases. In Proc. KDD'97, pp. 263-266.
18. Wang, K. 1997. Discovering patterns from large and dynamic sequential data. Journal of Intelligent Information Systems, 9:33-56.
19. Zaki, M.J. 2000. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning, pp. 31-60.
20. Zhang, M., Kao, B., Cheung, D., and Yip, C.-L. 2002. Efficient algorithms for incremental update of frequent sequences. In Proc. of the sixth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD). Taiwan, pp. 186-197.
21. Zhang, M., Kao, B., Yip, C., and Cheung, D. 2001. A GSP-Based efficient algorithm for mining frequent sequences. In Proc. of IC-AI'2001. Las Vegas, Nevada, USA, pp. 497-503.