Anzeige
Erschienen in:
2002 | OriginalPaper | Buchkapitel
Efficient Algorithms for Incremental Update of Frequent Sequences
verfasst von : Minghua Zhang, Ben Kao, David Cheung, Chi-Lap Yip
Erschienen in: Advances in Knowledge Discovery and Data Mining
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Most of the works proposed so far on mining frequent sequences assume that the underlying database is static. However, in real life, the database is modified from time to time. This paper studies the problem of incremental update of frequent sequences when the database changes. We propose two efficient incremental algorithms GSP+ and MFS+. Throught experimetns, we compare the performance of GSP+ and MFS+ with GSP and MFS — two efficient algorithms for mining frequent sequences. We show that GSP+ and MFS+ effectively reduce the CPU costs of their counterparts with only a small or even negative additional expense on I/O cost.