Incremental mining with prelarge trees

Chun Wei Lin, Tzung Pei Hong, Wen Hsiang Lu, Been Chian Chien

研究成果: Conference contribution

7 引文 斯高帕斯(Scopus)

摘要

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 easy. In this paper, we propose the structure of prelarge trees to incrementally mine association rules based on the concept of pre-large itemsets. Due to the properties of pre-large concepts, the proposed approach does not need to rescan the original database until a number of new transactions have been inserted. Experimental results also show that the proposed approach has a good performance for incrementally handling new transactions.

原文English
主出版物標題New Frontiers in Applied Artificial Intelligence - 21st International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2008, Proceedings
頁面169-178
頁數10
DOIs
出版狀態Published - 2008 8月 5
事件21st International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2008 - Wroclaw, Poland
持續時間: 2008 6月 182008 6月 20

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5027 LNAI
ISSN(列印)0302-9743
ISSN(電子)1611-3349

Other

Other21st International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2008
國家/地區Poland
城市Wroclaw
期間08-06-1808-06-20

All Science Journal Classification (ASJC) codes

  • 理論電腦科學
  • 一般電腦科學

指紋

深入研究「Incremental mining with prelarge trees」主題。共同形成了獨特的指紋。

引用此