An efficient approach for maintaining association rules based on adjusting FP-tree structures

Jia Ling Koh*, Shui Feng Shieh

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapter

93 Citations (Scopus)

Abstract

In this study, a general incremental updating technique is proposed for maintaining the frequent itemsets discovered in a database in the cases including insertion, deletion, and modification of transactions in the database. An efficient algorithm, called AFPIM (Adjusting FP-tree for Incremental Mining), is designed based on adjusting FP-tree structures. Our approach uses a FP-tree structure to store the compact information of transactions involving frequent and pre-frequent items in the original database. In most cases, without needing to rescan the original database, the new FP-tree structure of the updated database can be obtained by adjusting FP-tree of the original database according to the changed transactions. Experimental results show that AFPIM outperforms the existing algorithms in terms of the execution time.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsYoonJoon Lee, Kyu-Young Whang, Jianzhong Li, Doheon Lee
PublisherSpringer Verlag
Pages417-424
Number of pages8
ISBN (Print)3540210474, 9783540210474
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2973
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'An efficient approach for maintaining association rules based on adjusting FP-tree structures'. Together they form a unique fingerprint.

Cite this