Incremental and interactive sequence mining
Srinivasan Parthasarathy, Mohammed Javeed Zaki, Mitsunori Ogihara et al. · ACM International Conference on Information and Knowledge Management (CIKM) · 1999
The discovery of frequent sequences in temporal databases is an important data mining problem. Most current work assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. In this paper, we propose novel techniques for maintaining sequences in the presence of a) database updates, and b) user interaction (e.g. modifying mining parameters). This is a very challenging task, since such updates can invalidate existing sequences or introduce new ones. In both the above scenarios, we avoid re-executing the algorithm on the entire dataset, thereby reducing execution time. Experimental results confirm that our approach results in execution time improvements of up to several orders of magnitude in practice.
Cited by 209 works. doi:10.1145/319950.320010 Open-access PDF
Authors
References
- Mining sequential patterns: Generalizations and performance improvements
- Discovery of Frequent Episodes in Event Sequences
- Finding interesting rules from large sets of discovered association rules
- Exploratory mining and pruning optimizations of constrained associations rules
- Mining association rules with item constraints
- Maintenance of discovered association rules in large databases: an incremental updating technique
- Efficient enumeration of frequent sequences
- An efficient algorithm for the incremental updation of association rules in large databases
- Online generation of association rules
- Incremental and interactive sequence mining