An efficient FUSP-tree update algorithm for deleted data in customer sequences

Chun Wei Lin; Tzung Pei Hong; Wen-Hsiang Lu

doi:10.1109/ICICIC.2009.81

An efficient FUSP-tree update algorithm for deleted data in customer sequences

Chun Wei Lin, Tzung Pei Hong, Wen-Hsiang Lu

Department of Computer Science and Information Engineering

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

9 Citations (Scopus)

Abstract

In the past, the fast-updated sequential-pattern tree (call FUSP-tree) structure was proposed for mining sequential patterns from a set of customer sequences. An incremental mining algorithm was also designed for handling newly added transactions. Since data may also be deleted in real applications, an FUSP-tree maintenance algorithm for deletion of customer sequences is thus proposed in this paper for reducing the execution time in reconstructing the tree. Experimental results also show that the proposed tree-update algorithm has a good performance than the batch FUSP-tree algorithm for handling the deletion of customer sequences. The proposed tree-update algorithm thus makes the tree update process become easy and efficient.

Original language	English
Title of host publication	2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
Pages	1491-1494
Number of pages	4
DOIs	https://doi.org/10.1109/ICICIC.2009.81
Publication status	Published - 2009 Dec 1
Event	2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009 - Kaohsiung, Taiwan Duration: 2009 Dec 7 → 2009 Dec 9

Publication series

Name	2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009

Other

Other	2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
Country/Territory	Taiwan
City	Kaohsiung
Period	09-12-07 → 09-12-09

All Science Journal Classification (ASJC) codes

Computational Theory and Mathematics
Computer Networks and Communications
Software

Access to Document

10.1109/ICICIC.2009.81

Cite this

Lin, C. W., Hong, T. P., & Lu, W.-H. (2009). An efficient FUSP-tree update algorithm for deleted data in customer sequences. In 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009 (pp. 1491-1494). Article 5412212 (2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009). https://doi.org/10.1109/ICICIC.2009.81

@inproceedings{624b17ab5c904cd9baf0a8850beab2f6,

title = "An efficient FUSP-tree update algorithm for deleted data in customer sequences",

abstract = "In the past, the fast-updated sequential-pattern tree (call FUSP-tree) structure was proposed for mining sequential patterns from a set of customer sequences. An incremental mining algorithm was also designed for handling newly added transactions. Since data may also be deleted in real applications, an FUSP-tree maintenance algorithm for deletion of customer sequences is thus proposed in this paper for reducing the execution time in reconstructing the tree. Experimental results also show that the proposed tree-update algorithm has a good performance than the batch FUSP-tree algorithm for handling the deletion of customer sequences. The proposed tree-update algorithm thus makes the tree update process become easy and efficient.",

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

year = "2009",

month = dec,

day = "1",

doi = "10.1109/ICICIC.2009.81",

language = "English",

isbn = "9780769538730",

series = "2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009",

pages = "1491--1494",

booktitle = "2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009",

note = "2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009 ; Conference date: 07-12-2009 Through 09-12-2009",

}

Lin, CW, Hong, TP & Lu, W-H 2009, An efficient FUSP-tree update algorithm for deleted data in customer sequences. in 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009., 5412212, 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009, pp. 1491-1494, 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009, Kaohsiung, Taiwan, 09-12-07. https://doi.org/10.1109/ICICIC.2009.81

An efficient FUSP-tree update algorithm for deleted data in customer sequences. / Lin, Chun Wei; Hong, Tzung Pei; Lu, Wen-Hsiang.
2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009. 2009. p. 1491-1494 5412212 (2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009).

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

TY - GEN

T1 - An efficient FUSP-tree update algorithm for deleted data in customer sequences

AU - Lin, Chun Wei

AU - Hong, Tzung Pei

AU - Lu, Wen-Hsiang

PY - 2009/12/1

Y1 - 2009/12/1

N2 - In the past, the fast-updated sequential-pattern tree (call FUSP-tree) structure was proposed for mining sequential patterns from a set of customer sequences. An incremental mining algorithm was also designed for handling newly added transactions. Since data may also be deleted in real applications, an FUSP-tree maintenance algorithm for deletion of customer sequences is thus proposed in this paper for reducing the execution time in reconstructing the tree. Experimental results also show that the proposed tree-update algorithm has a good performance than the batch FUSP-tree algorithm for handling the deletion of customer sequences. The proposed tree-update algorithm thus makes the tree update process become easy and efficient.

AB - In the past, the fast-updated sequential-pattern tree (call FUSP-tree) structure was proposed for mining sequential patterns from a set of customer sequences. An incremental mining algorithm was also designed for handling newly added transactions. Since data may also be deleted in real applications, an FUSP-tree maintenance algorithm for deletion of customer sequences is thus proposed in this paper for reducing the execution time in reconstructing the tree. Experimental results also show that the proposed tree-update algorithm has a good performance than the batch FUSP-tree algorithm for handling the deletion of customer sequences. The proposed tree-update algorithm thus makes the tree update process become easy and efficient.

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

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

U2 - 10.1109/ICICIC.2009.81

DO - 10.1109/ICICIC.2009.81

M3 - Conference contribution

AN - SCOPUS:77951447570

SN - 9780769538730

T3 - 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009

SP - 1491

EP - 1494

BT - 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009

T2 - 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009

Y2 - 7 December 2009 through 9 December 2009

ER -

An efficient FUSP-tree update algorithm for deleted data in customer sequences

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this