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
CountryUnited States
CityHonolulu, HI
Period07-04-0107-04-05

Fingerprint

Transactions
Mining
Tree Structure
Execution Time
Maintenance
Update
Experimental Results
Concepts

All Science Journal Classification (ASJC) codes

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

Cite this

Lin, C. W., Hong, T. P., & Lu, W-H. (2007). Using the Pre-FUFP algorithm for handling new transactions in incremental mining. In Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007 (pp. 598-603). [4221354] (Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007). https://doi.org/10.1109/CIDM.2007.368930
Lin, Chun Wei ; Hong, Tzung Pei ; Lu, Wen-Hsiang. / Using the Pre-FUFP algorithm for handling new transactions in incremental mining. Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007. 2007. pp. 598-603 (Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007).
@inproceedings{3eea8bd2ea634852801cadf168bd3880,
title = "Using the Pre-FUFP algorithm for handling new transactions in incremental mining",
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.",
author = "Lin, {Chun Wei} and Hong, {Tzung Pei} and Wen-Hsiang Lu",
year = "2007",
month = "9",
day = "25",
doi = "10.1109/CIDM.2007.368930",
language = "English",
isbn = "1424407052",
series = "Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007",
pages = "598--603",
booktitle = "Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007",

}

Lin, CW, Hong, TP & Lu, W-H 2007, Using the Pre-FUFP algorithm for handling new transactions in incremental mining. in Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007., 4221354, Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007, pp. 598-603, 1st IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007, Honolulu, HI, United States, 07-04-01. https://doi.org/10.1109/CIDM.2007.368930

Using the Pre-FUFP algorithm for handling new transactions in incremental mining. / Lin, Chun Wei; Hong, Tzung Pei; Lu, Wen-Hsiang.

Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007. 2007. p. 598-603 4221354 (Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007).

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

TY - GEN

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

AU - Lin, Chun Wei

AU - Hong, Tzung Pei

AU - Lu, Wen-Hsiang

PY - 2007/9/25

Y1 - 2007/9/25

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34548725166&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34548725166&partnerID=8YFLogxK

U2 - 10.1109/CIDM.2007.368930

DO - 10.1109/CIDM.2007.368930

M3 - Conference contribution

AN - SCOPUS:34548725166

SN - 1424407052

SN - 9781424407057

T3 - Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007

SP - 598

EP - 603

BT - Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007

ER -

Lin CW, Hong TP, Lu W-H. Using the Pre-FUFP algorithm for handling new transactions in incremental mining. In Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007. 2007. p. 598-603. 4221354. (Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007). https://doi.org/10.1109/CIDM.2007.368930