Among various data mining techniques, sequential-pattern mining is used to discover the frequent subsequences from a sequence database. Most research handles the static database in batch mode to discover the desired sequential patterns. Transactions or customer sequences are, however, dynamically changed in real-world applications. In the past, the FUSP tree was designed to maintain and update the discovered information based on Fast UPdated (FUP) approach with sequence insertion and sequence deletion. The original customer sequences is still required to be rescanned if it is necessary. In this paper, the prelarge concept is adopted to maintain and update the built FUSP tree with sequence deletion. When the number of deleted customers is smaller than the safety bound of the prelarge concept, the original database is unnecessary to be rescanned but the sequential patterns can still be actually maintained and updated. Experiments are also conducted to show the performance of the proposed algorithm in terms of execution time and number of tree nodes.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
- Updating the Built FUSP Trees with Sequence Deletion Based on Prelarge Concept
- Springer Berlin Heidelberg
Neuer Inhalt/© ITandMEDIA