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

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

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)5163-5177
Number of pages15
JournalInternational Journal of Innovative Computing, Information and Control
Volume6
Issue number11
Publication statusPublished - 2010 Nov 1

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'Efficient modification of fast updated FP-trees based on pre-large concepts'. Together they form a unique fingerprint.

Cite this