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

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

研究成果: Conference contribution

9 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
頁面1491-1494
頁數4
DOIs
出版狀態Published - 2009 12月 1
事件2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009 - Kaohsiung, Taiwan
持續時間: 2009 12月 72009 12月 9

出版系列

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

Other

Other2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
國家/地區Taiwan
城市Kaohsiung
期間09-12-0709-12-09

All Science Journal Classification (ASJC) codes

  • 計算機理論與數學
  • 電腦網路與通信
  • 軟體

指紋

深入研究「An efficient FUSP-tree update algorithm for deleted data in customer sequences」主題。共同形成了獨特的指紋。

引用此