Maintenance of the pre-large trees for record deletion

Chun Wei Lin, Tzung Pei Hong, Wen-Hsiang Lu

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

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAdvances in Numerical Methods
EditorsNikos Mastorakis, John Sakellaris
Pages137-148
Number of pages12
DOIs
Publication statusPublished - 2009 Dec 1

Publication series

NameLecture Notes in Electrical Engineering
Volume11
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Fingerprint

Association rules
Data structures

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

Lin, C. W., Hong, T. P., & Lu, W-H. (2009). Maintenance of the pre-large trees for record deletion. In N. Mastorakis, & J. Sakellaris (Eds.), Advances in Numerical Methods (pp. 137-148). (Lecture Notes in Electrical Engineering; Vol. 11). https://doi.org/10.1007/978-0-387-76483-2_12
Lin, Chun Wei ; Hong, Tzung Pei ; Lu, Wen-Hsiang. / Maintenance of the pre-large trees for record deletion. Advances in Numerical Methods. editor / Nikos Mastorakis ; John Sakellaris. 2009. pp. 137-148 (Lecture Notes in Electrical Engineering).
@inproceedings{646cd001360044d7a3d2e9fd5bea523a,
title = "Maintenance of the pre-large trees for record deletion",
abstract = "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.",
author = "Lin, {Chun Wei} and Hong, {Tzung Pei} and Wen-Hsiang Lu",
year = "2009",
month = "12",
day = "1",
doi = "10.1007/978-0-387-76483-2_12",
language = "English",
isbn = "9780387764825",
series = "Lecture Notes in Electrical Engineering",
pages = "137--148",
editor = "Nikos Mastorakis and John Sakellaris",
booktitle = "Advances in Numerical Methods",

}

Lin, CW, Hong, TP & Lu, W-H 2009, Maintenance of the pre-large trees for record deletion. in N Mastorakis & J Sakellaris (eds), Advances in Numerical Methods. Lecture Notes in Electrical Engineering, vol. 11, pp. 137-148. https://doi.org/10.1007/978-0-387-76483-2_12

Maintenance of the pre-large trees for record deletion. / Lin, Chun Wei; Hong, Tzung Pei; Lu, Wen-Hsiang.

Advances in Numerical Methods. ed. / Nikos Mastorakis; John Sakellaris. 2009. p. 137-148 (Lecture Notes in Electrical Engineering; Vol. 11).

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

TY - GEN

T1 - Maintenance of the pre-large trees for record deletion

AU - Lin, Chun Wei

AU - Hong, Tzung Pei

AU - Lu, Wen-Hsiang

PY - 2009/12/1

Y1 - 2009/12/1

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

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

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

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

U2 - 10.1007/978-0-387-76483-2_12

DO - 10.1007/978-0-387-76483-2_12

M3 - Conference contribution

SN - 9780387764825

T3 - Lecture Notes in Electrical Engineering

SP - 137

EP - 148

BT - Advances in Numerical Methods

A2 - Mastorakis, Nikos

A2 - Sakellaris, John

ER -

Lin CW, Hong TP, Lu W-H. Maintenance of the pre-large trees for record deletion. In Mastorakis N, Sakellaris J, editors, Advances in Numerical Methods. 2009. p. 137-148. (Lecture Notes in Electrical Engineering). https://doi.org/10.1007/978-0-387-76483-2_12