An FUSP-tree maintenance algorithm for record modification

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

doi:10.1109/ICDMW.2008.81

An FUSP-tree maintenance algorithm for record modification

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

Department of Computer Science and Information Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008
Pages	649-653
Number of pages	5
DOIs	https://doi.org/10.1109/ICDMW.2008.81
Publication status	Published - 2008 Dec 1
Event	IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008 - Pisa, Italy Duration: 2008 Dec 15 → 2008 Dec 19

Publication series

Name	Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008

Other

Other	IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008
Country/Territory	Italy
City	Pisa
Period	08-12-15 → 08-12-19

All Science Journal Classification (ASJC) codes

Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/ICDMW.2008.81

Cite this

Lin, C. W., Hong, T. P., Lu, W. H., & Chen, H. Y. (2008). An FUSP-tree maintenance algorithm for record modification. In Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008 (pp. 649-653). Article 4733990 (Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008). https://doi.org/10.1109/ICDMW.2008.81

@inproceedings{abfdb391cf864b539ff4ed70a5be5f40,

title = "An FUSP-tree maintenance algorithm for record modification",

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.",

author = "Lin, {Chun Wei} and Hong, {Tzung Pei} and Lu, {Wen Hsiang} and Chen, {Hsin Yi}",

year = "2008",

month = dec,

day = "1",

doi = "10.1109/ICDMW.2008.81",

language = "English",

isbn = "9780769535036",

series = "Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008",

pages = "649--653",

booktitle = "Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008",

note = "IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008 ; Conference date: 15-12-2008 Through 19-12-2008",

}

Lin, CW, Hong, TP, Lu, WH & Chen, HY 2008, An FUSP-tree maintenance algorithm for record modification. in Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008., 4733990, Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008, pp. 649-653, IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008, Pisa, Italy, 08-12-15. https://doi.org/10.1109/ICDMW.2008.81

An FUSP-tree maintenance algorithm for record modification. / Lin, Chun Wei; Hong, Tzung Pei; Lu, Wen Hsiang et al.
Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008. 2008. p. 649-653 4733990 (Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - An FUSP-tree maintenance algorithm for record modification

AU - Lin, Chun Wei

AU - Hong, Tzung Pei

AU - Lu, Wen Hsiang

AU - Chen, Hsin Yi

PY - 2008/12/1

Y1 - 2008/12/1

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

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

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

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

U2 - 10.1109/ICDMW.2008.81

DO - 10.1109/ICDMW.2008.81

M3 - Conference contribution

AN - SCOPUS:62449312294

SN - 9780769535036

T3 - Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008

SP - 649

EP - 653

BT - Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008

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

Y2 - 15 December 2008 through 19 December 2008

ER -

An FUSP-tree maintenance algorithm for record modification

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this