Incremental and interactive sequence mining

S. Parthasarathy, M. J. Zaki, M. Ogihara, S. Dwarkadas

Research output: Chapter in Book/Report/Conference proceedingConference contribution

124 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationInternational Conference on Information and Knowledge Management, Proceedings
Place of PublicationNew York, NY, United States
PublisherACM
Pages251-258
Number of pages8
ISBN (Print)1581131461
Publication statusPublished - 1 Dec 1999
Externally publishedYes
EventProceedings of the 1999 8th International Conference on Information Knowledge Management (CIKM'99) - Kansas City, MO, USA
Duration: 2 Nov 19996 Nov 1999

Other

OtherProceedings of the 1999 8th International Conference on Information Knowledge Management (CIKM'99)
CityKansas City, MO, USA
Period2/11/996/11/99

    Fingerprint

ASJC Scopus subject areas

  • Business, Management and Accounting(all)

Cite this

Parthasarathy, S., Zaki, M. J., Ogihara, M., & Dwarkadas, S. (1999). Incremental and interactive sequence mining. In International Conference on Information and Knowledge Management, Proceedings (pp. 251-258). ACM.