Using the Pre-FUFP algorithm for handling new transactions in incremental mining

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

研究成果: Conference contribution

摘要

In the past, we proposed a Fast Updated FP-tree (FUFP-tree) structure to efficiently handle new transactions and to make the tree update process become easier. In this paper, we attempt to modify the FUFP-tree construction based on the concept of pre-large itemsets. Pre-large itemsets are defined by a lower support threshold and an upper support threshold. The proposed approach can achieve a good execution time for tree construction especially when each time a small number of transactions are inserted. Experimental results also show that the proposed Pre-FUFP maintenance algorithm has a good performance for incrementally handling new transactions.

原文English
主出版物標題Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007
頁面598-603
頁數6
DOIs
出版狀態Published - 2007 9月 25
事件1st IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007 - Honolulu, HI, United States
持續時間: 2007 4月 12007 4月 5

出版系列

名字Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007

Other

Other1st IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007
國家/地區United States
城市Honolulu, HI
期間07-04-0107-04-05

All Science Journal Classification (ASJC) codes

  • 資訊系統
  • 訊號處理
  • 軟體
  • 理論電腦科學

指紋

深入研究「Using the Pre-FUFP algorithm for handling new transactions in incremental mining」主題。共同形成了獨特的指紋。

引用此