An FUSP-tree maintenance algorithm for record modification

Chun Wei Lin, Tzung Pei Hong, Wen Hsiang Lu, Hsin Yi Chen

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

4 Citations (Scopus)

Abstract

There are several algorithms proposed for maintaining the sequential patterns as records are inserted. In addition to record insertion, the pattern maintenance for record modification is also very important in the real-applications. In the past, we have proposed the fast updated sequential pattern tree (called FUSP tree) structure for handling record insertion. In this paper, we attempt to handle the maintenance of sequential patterns for record modification. We do the task by maintaining the FUSP tree and then generate the patterns whenever necessary. An FUSP-tree maintenance algorithm for record modification is thus proposed for reducing the execution time in reconstructing the tree. The proposed approach is expected to achieve a good trade-off between execution time and tree complexity.

Original languageEnglish
Title of host publicationProceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008
Pages649-653
Number of pages5
DOIs
Publication statusPublished - 2008 Dec 1
EventIEEE International Conference on Data Mining Workshops, ICDM Workshops 2008 - Pisa, Italy
Duration: 2008 Dec 152008 Dec 19

Publication series

NameProceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008

Other

OtherIEEE International Conference on Data Mining Workshops, ICDM Workshops 2008
CountryItaly
CityPisa
Period08-12-1508-12-19

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this