Browse > Article

An Incremental Updating Algorithm of Sequential Patterns  

Kim Hak-Ja (Department of Computer and Telecommunication Eng., Kangwon National University)
Whang Whan-Kyu (Department of Computer and Telecommunication Eng., Kangwon National University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea CI / v.43, no.5, 2006 , pp. 17-28 More about this Journal
Abstract
In this paper, we investigate a problem of updating sequential patterns when new transactions are added to a database. We present an efficient updating algorithm for sequential pattern mining that incrementally updates added transactions by reusing frequent patterns found previously. Our performance study shows that this method outperforms both AprioriAll and PrefixSpan algorithm which updates from scratch, since our method can efficiently utilize reduced candidate sets which result from the incremental updating technique.
Keywords
데이터 마이닝;순차 패턴;순차 패턴 갱신;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Agrawal and R. Srikant, 'Mining Sequential Patterns,' Proc. of the 11th International Conference on Data Eng. (ICDE'95), Taipei, Taiwan, March, 1995.   DOI
2 D. W. Cheung, Jiawei Han, Vincent T. Ng, C.Y Wong, 'Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique,' Proc. of the 12th Int. Conf. on Data Eng. (ICDE'96), 1996   DOI
3 J. Pei, J. Han, H. Pinto, Q. Chen, U. Dayal, and M. -C. Hsu, 'PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth,' Proc. 2001 Int. Conf. on Data Eng. (ICDE'01), Heidelberg, Germany, April 2001
4 M.-S. Chen, J. Han, and P.S. Yu, 'Data Mining: An Overview from a Database Perspective,' IEEE Transactions on knowledge and Data Engineering, Vol. 8, No.6, pp. 866-883, Dec. 1996   DOI   ScienceOn
5 R. Agrawal, T. Imielinski, and A. Swami, 'Mining Association Rules in Large Databases,' Proc. of ACM SIGMOD Conference on Management of Data, Washington DC, pp. 207-216, May 1993