The task of sequential pattern mining is to discover the complete set of sequential patterns in a given sequence database with minimum support threshold. But in practice, minimum support some time is defined afterward, or need to be adjusted to discover information that interest to knowledge workers. In the same time, the problem of discover sequential patterns in a incremental database is an essential issue in real world practice of datamining. This paper discusses the issue of maintaining discovered sequential patterns when some information is appended to a sequence database. Many previous works based on Apriori-like approaches are not capable to do so without re-running previously presented algorithms on the whole updated database. We propose a novel algorithm, called DSPID, which takes full advantage of the information obtained from previous mining results to cut down the cost of finding new sequential patterns in an incremental database.
International Journal of Computers 4(1), pp.197-201