Maintenance of sequential patterns for record modification using pre-large sequences

In previous work we proposed incremental mining algorithms for maintenance of sequential patterns based on the concept of pre-large sequences as records were inserted or deleted. Although maintenance of sequential patterns for record modification can be performed by using the deletion procedure and then the insertion procedure, double the computation time of a single procedure is needed. In this paper, we attempt to apply the concept of pre-large sequences to maintain sequential patterns as records are modified. The proposed algorithm does not require rescanning original databases until the accumulative number of modified customer sequences exceeds a safety bound derived by a pre-large concept. As databases grow larger, the number of modified customer sequences allowed before database rescanning also needs to grow.