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

Jia Ling Koh*, Shui Feng Shieh

*此作品的通信作者

研究成果: 書貢獻/報告類型篇章

90 引文 斯高帕斯(Scopus)

摘要

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.

原文英語
主出版物標題Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
編輯YoonJoon Lee, Kyu-Young Whang, Jianzhong Li, Doheon Lee
發行者Springer Verlag
頁面417-424
頁數8
ISBN(列印)3540210474, 9783540210474
DOIs
出版狀態已發佈 - 2004

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2973
ISSN(列印)0302-9743
ISSN(電子)1611-3349

ASJC Scopus subject areas

  • 理論電腦科學
  • 電腦科學(全部)

指紋

深入研究「An efficient approach for maintaining association rules based on adjusting FP-tree structures」主題。共同形成了獨特的指紋。

引用此