2002/03/27 by Qingguo Zheng, Ke Xu, Shilong Ma +1
Computer Science · #cs.DB #cs.AI
published as The Second SIAM Data mining2002: workshop HPDM · 12 pages, 4 figures
arxiv created 2002/03/27 · arxiv updated 2009/11/30
Because the data being mined in the temporal database will evolve with time, many researchers have focused on the incremental mining of frequent sequences in temporal database. In this paper, we propose an algorithm called IUS, using the frequent and negative border sequences in the original database for incremental sequence mining. To deal with the case where some data need to be updated from the original database, we present an algorithm called DUS to maintain sequential patterns in the updated database. We also define the negative border sequence threshold: Minnbdsupp to control the number of sequences in the negative border.