Maintenance of the pre-large trees for record deletion

Chun Wei Lin, Tzung Pei Hong, Wen Hsiang Lu

研究成果: Conference contribution

3 引文 斯高帕斯(Scopus)

摘要

The frequent pattern tree (FP-tree) is an efficient data structure for association-rule mining without generation of candidate itemsets. It, however, needed to process all transactions in a batch way. In addition to record insertion, record deletion is also commonly seen in real applications. In this chapter, we propose the structure of pre-large trees for efficiently handling deletion of records based on the concept of pre-large itemsets. Due to the properties of pre-large concepts, the proposed approach does not need to rescan the original database until a number of records have been deleted. The proposed approach can thus achieve a good execution time for tree construction especially when a small number of records are deleted each time. Experimental results also show that the proposed approach has a good performance for incrementally handling deleted records.

原文English
主出版物標題Advances in Numerical Methods
編輯Nikos Mastorakis, John Sakellaris
頁面137-148
頁數12
DOIs
出版狀態Published - 2009

出版系列

名字Lecture Notes in Electrical Engineering
11
ISSN(列印)1876-1100
ISSN(電子)1876-1119

All Science Journal Classification (ASJC) codes

  • 工業與製造工程

指紋

深入研究「Maintenance of the pre-large trees for record deletion」主題。共同形成了獨特的指紋。

引用此