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

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

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publication2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
Pages1491-1494
Number of pages4
DOIs
Publication statusPublished - 2009 Dec 1
Event2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009 - Kaohsiung, Taiwan
Duration: 2009 Dec 72009 Dec 9

Publication series

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

Other

Other2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
CountryTaiwan
CityKaohsiung
Period09-12-0709-12-09

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Software

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). [5412212] (2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009). https://doi.org/10.1109/ICICIC.2009.81
Lin, Chun Wei ; Hong, Tzung Pei ; Lu, Wen-Hsiang. / An efficient FUSP-tree update algorithm for deleted data in customer sequences. 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009. 2009. pp. 1491-1494 (2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009).
@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 = "12",
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",

}

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 proceedingConference 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

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

ER -

Lin CW, Hong TP, Lu W-H. 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. 2009. p. 1491-1494. 5412212. (2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009). https://doi.org/10.1109/ICICIC.2009.81