Incremental and interactive sequence mining

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

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

121 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 (US)
Title of host publicationInternational Conference on Information and Knowledge Management, Proceedings
PublisherACM
Pages251-258
Number of pages8
ISBN (Print)1581131461
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 8th International Conference on Information Knowledge Management (CIKM'99) - Kansas City, MO, USA
Duration: Nov 2 1999Nov 6 1999

Other

OtherProceedings of the 1999 8th International Conference on Information Knowledge Management (CIKM'99)
CityKansas City, MO, USA
Period11/2/9911/6/99

Fingerprint

Incremental
Data base
Scenarios
Interaction
Data mining

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.

Incremental and interactive sequence mining. / Parthasarathy, S.; Zaki, M. J.; Ogihara, Mitsunori; Dwarkadas, S.

International Conference on Information and Knowledge Management, Proceedings. ACM, 1999. p. 251-258.

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

Parthasarathy, S, Zaki, MJ, Ogihara, M & Dwarkadas, S 1999, Incremental and interactive sequence mining. in International Conference on Information and Knowledge Management, Proceedings. ACM, pp. 251-258, Proceedings of the 1999 8th International Conference on Information Knowledge Management (CIKM'99), Kansas City, MO, USA, 11/2/99.
Parthasarathy S, Zaki MJ, Ogihara M, Dwarkadas S. Incremental and interactive sequence mining. In International Conference on Information and Knowledge Management, Proceedings. ACM. 1999. p. 251-258
Parthasarathy, S. ; Zaki, M. J. ; Ogihara, Mitsunori ; Dwarkadas, S. / Incremental and interactive sequence mining. International Conference on Information and Knowledge Management, Proceedings. ACM, 1999. pp. 251-258
@inproceedings{55b0a3db682c469c8ed8c090a202a153,
title = "Incremental and interactive sequence mining",
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.",
author = "S. Parthasarathy and Zaki, {M. J.} and Mitsunori Ogihara and S. Dwarkadas",
year = "1999",
language = "English (US)",
isbn = "1581131461",
pages = "251--258",
booktitle = "International Conference on Information and Knowledge Management, Proceedings",
publisher = "ACM",

}

TY - GEN

T1 - Incremental and interactive sequence mining

AU - Parthasarathy, S.

AU - Zaki, M. J.

AU - Ogihara, Mitsunori

AU - Dwarkadas, S.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033279536&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033279536&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0033279536

SN - 1581131461

SP - 251

EP - 258

BT - International Conference on Information and Knowledge Management, Proceedings

PB - ACM

ER -