Incrementally fast updated sequential pattern trees

Tzung Pei Hong, Hsin Yi Chen, Chun Wei Lin, Sheng Tun Li

研究成果: Conference contribution

6 引文 斯高帕斯(Scopus)

摘要

In the past, the FUFP-tree maintenance algorithm is proposed to efficiently handle the association rules in incremental mining. In this paper, we attempt to modify the FUFP-tree maintenance algorithm for maintaining sequential patterns based on the concept of pre-large sequences to reduce the need for rescanning original databases in incremental mining. A fast updated sequential pattern trees (FUSP trees) structure and the maintenance algorithm are proposed, which makes the tree update process become easier. It does not require rescanning original customer sequences until the accumulative amount of newly added customer sequences exceed a safety bound, which depends on database size. The proposed approach thus becomes efficiently and effectively for handling newly added customer sequences.

原文English
主出版物標題Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC
頁面3991-3996
頁數6
DOIs
出版狀態Published - 2008
事件7th International Conference on Machine Learning and Cybernetics, ICMLC - Kunming, China
持續時間: 2008 七月 122008 七月 15

出版系列

名字Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC
7

Other

Other7th International Conference on Machine Learning and Cybernetics, ICMLC
國家/地區China
城市Kunming
期間08-07-1208-07-15

All Science Journal Classification (ASJC) codes

  • 人工智慧
  • 人機介面
  • 控制與系統工程

指紋

深入研究「Incrementally fast updated sequential pattern trees」主題。共同形成了獨特的指紋。

引用此