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

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007
Pages598-603
Number of pages6
DOIs
Publication statusPublished - 2007 Sep 25
Event1st IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007 - Honolulu, HI, United States
Duration: 2007 Apr 12007 Apr 5

Publication series

NameProceedings 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
Country/TerritoryUnited States
CityHonolulu, HI
Period07-04-0107-04-05

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Signal Processing
  • Software
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'Using the Pre-FUFP algorithm for handling new transactions in incremental mining'. Together they form a unique fingerprint.

Cite this