Maintaining pre-large FUSP trees for record deletion

Tzung Pei Hong, Hsin Yi Chen, Chun Wei Lin, Sheng-Tun Li

研究成果: Conference contribution

1 引文 (Scopus)

摘要

In the past, a pre-large fast-updated sequential pattern tree (pre-large FUSP tree) structure was proposed to effectively handle newly inserted customer sequences for data mining. Since data deletion also commonly occurs in real applications, in this paper, we thus propose a maintenance algorithm for prelarge FUSP trees when records are deleted from the mined database. Pre-large sequences act like buffers and are used to reduce the movement of sequences directly from large to small and vice-versa when records are deleted. Experimental results also show that the proposed pre-large FUSP-tree maintenance algorithm for record deletion has a good performance when compared to the batch maintenance algorithm.

原文English
主出版物標題Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009
頁面948-953
頁數6
DOIs
出版狀態Published - 2009 十一月 20
事件2009 International Conference on New Trends in Information and Service Science, NISS 2009 - Beijing, China
持續時間: 2009 六月 302009 七月 2

出版系列

名字Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009

Other

Other2009 International Conference on New Trends in Information and Service Science, NISS 2009
國家China
城市Beijing
期間09-06-3009-07-02

指紋

Data mining

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

引用此文

Hong, T. P., Chen, H. Y., Lin, C. W., & Li, S-T. (2009). Maintaining pre-large FUSP trees for record deletion. 於 Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009 (頁 948-953). [5260742] (Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009). https://doi.org/10.1109/NISS.2009.194
Hong, Tzung Pei ; Chen, Hsin Yi ; Lin, Chun Wei ; Li, Sheng-Tun. / Maintaining pre-large FUSP trees for record deletion. Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009. 2009. 頁 948-953 (Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009).
@inproceedings{f73f69fd879d49dea890778b941db074,
title = "Maintaining pre-large FUSP trees for record deletion",
abstract = "In the past, a pre-large fast-updated sequential pattern tree (pre-large FUSP tree) structure was proposed to effectively handle newly inserted customer sequences for data mining. Since data deletion also commonly occurs in real applications, in this paper, we thus propose a maintenance algorithm for prelarge FUSP trees when records are deleted from the mined database. Pre-large sequences act like buffers and are used to reduce the movement of sequences directly from large to small and vice-versa when records are deleted. Experimental results also show that the proposed pre-large FUSP-tree maintenance algorithm for record deletion has a good performance when compared to the batch maintenance algorithm.",
author = "Hong, {Tzung Pei} and Chen, {Hsin Yi} and Lin, {Chun Wei} and Sheng-Tun Li",
year = "2009",
month = "11",
day = "20",
doi = "10.1109/NISS.2009.194",
language = "English",
isbn = "9780769536873",
series = "Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009",
pages = "948--953",
booktitle = "Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009",

}

Hong, TP, Chen, HY, Lin, CW & Li, S-T 2009, Maintaining pre-large FUSP trees for record deletion. 於 Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009., 5260742, Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009, 頁 948-953, 2009 International Conference on New Trends in Information and Service Science, NISS 2009, Beijing, China, 09-06-30. https://doi.org/10.1109/NISS.2009.194

Maintaining pre-large FUSP trees for record deletion. / Hong, Tzung Pei; Chen, Hsin Yi; Lin, Chun Wei; Li, Sheng-Tun.

Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009. 2009. p. 948-953 5260742 (Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009).

研究成果: Conference contribution

TY - GEN

T1 - Maintaining pre-large FUSP trees for record deletion

AU - Hong, Tzung Pei

AU - Chen, Hsin Yi

AU - Lin, Chun Wei

AU - Li, Sheng-Tun

PY - 2009/11/20

Y1 - 2009/11/20

N2 - In the past, a pre-large fast-updated sequential pattern tree (pre-large FUSP tree) structure was proposed to effectively handle newly inserted customer sequences for data mining. Since data deletion also commonly occurs in real applications, in this paper, we thus propose a maintenance algorithm for prelarge FUSP trees when records are deleted from the mined database. Pre-large sequences act like buffers and are used to reduce the movement of sequences directly from large to small and vice-versa when records are deleted. Experimental results also show that the proposed pre-large FUSP-tree maintenance algorithm for record deletion has a good performance when compared to the batch maintenance algorithm.

AB - In the past, a pre-large fast-updated sequential pattern tree (pre-large FUSP tree) structure was proposed to effectively handle newly inserted customer sequences for data mining. Since data deletion also commonly occurs in real applications, in this paper, we thus propose a maintenance algorithm for prelarge FUSP trees when records are deleted from the mined database. Pre-large sequences act like buffers and are used to reduce the movement of sequences directly from large to small and vice-versa when records are deleted. Experimental results also show that the proposed pre-large FUSP-tree maintenance algorithm for record deletion has a good performance when compared to the batch maintenance algorithm.

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

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

U2 - 10.1109/NISS.2009.194

DO - 10.1109/NISS.2009.194

M3 - Conference contribution

AN - SCOPUS:70449562735

SN - 9780769536873

T3 - Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009

SP - 948

EP - 953

BT - Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009

ER -

Hong TP, Chen HY, Lin CW, Li S-T. Maintaining pre-large FUSP trees for record deletion. 於 Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009. 2009. p. 948-953. 5260742. (Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009). https://doi.org/10.1109/NISS.2009.194