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

Jia Ling Koh, Shui Feng Shieh

研究成果: 雜誌貢獻文章同行評審

80 引文 斯高帕斯(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.

原文英語
頁(從 - 到)417-424
頁數8
期刊Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2973
出版狀態已發佈 - 2004 十二月 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

引用此