Affiliations: [a] Institute of Computer and Information Science, National Chiao-Tung University, Hsinchu, 300, Taiwan, R.O.C. E-mail: cywang@cis.nctu.edu.tw, sstseng@cis.nctu.edu.tw | [b] Department of Electrical Engineering, National University of Kaohsiung, Kaohsiung, 811, Taiwan, R.O.C. E-mail: tphong@nuk.edu.tw
Correspondence:
[*]
Corresponding author
Note: [1] This is a modified and expanded version of the paper “A pattern-maintenance algorithm for record deletion in temporal
transaction databases”, presented at The Sixth Conference on Artificial Intelligence and Applications, Kaohsiung, Taiwan 2001.
Abstract: Mining sequential patterns from temporal transaction databases attempts to find customer behavior models and to assist managers in making correct and effective decisions. The sequential patterns discovered may, however, become invalid or inappropriate when databases are updated. Conventional approaches may re-mine entire databases to get correct sequential patterns for maintenance. However, when a database is massive in size, this will require considerable computation time. In the past, Lin and Lee proposed an incremental mining algorithm for maintenance of sequential patterns as new records were inserted. In addition to record insertion, record deletion is also commonly seen in real-world applications. Processing record deletion is, however, different from processing record insertion. The former can even be thought of the contrary of the latter. In this paper, we thus attempt to design an effective maintenance algorithm for sequential patterns as records are deleted. Our proposed algorithm utilizes previously discovered large sequences in the maintenance process, thus reducing numbers of rescanning databases. In addition, rescanning requirement depends on decreased numbers of customers, which are usually zero when numbers of deleted records are not large. This characteristic is especially useful for dynamic database mining.
Keywords: data mining, sequential pattern, incremental mining
