Efficient modification of fast updated FP-trees based on pre-large concepts

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

研究成果: Article同行評審

4 引文 斯高帕斯(Scopus)

摘要

In this paper, we propose a new FUFP-tree maintenance algorithm, based on the concept of pre-large itemsets, in order to efficiently handle record modification. Pre-large itemsets are defined by a lower support threshold and an upper support threshold. This helps to reduce rescans of the original database. The proposed approach can get good execution time for tree maintenance, especially when a small number of records are modified. Experimental results showed that the proposed Pre-FUFP modification algorithm performed well when handling updated records and generated nearly the same tree structure as the original FP tree algorithm.

原文English
頁(從 - 到)5163-5177
頁數15
期刊International Journal of Innovative Computing, Information and Control
6
發行號11
出版狀態Published - 2010 十一月 1

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Information Systems
  • Computational Theory and Mathematics

指紋 深入研究「Efficient modification of fast updated FP-trees based on pre-large concepts」主題。共同形成了獨特的指紋。

引用此