Incrementally fast updated sequential pattern trees

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

研究成果: Conference contribution

5 引文 (Scopus)

摘要

In the past, the FUFP-tree maintenance algorithm is proposed to efficiently handle the association rules in incremental mining. In this paper, we attempt to modify the FUFP-tree maintenance algorithm for maintaining sequential patterns based on the concept of pre-large sequences to reduce the need for rescanning original databases in incremental mining. A fast updated sequential pattern trees (FUSP trees) structure and the maintenance algorithm are proposed, which makes the tree update process become easier. It does not require rescanning original customer sequences until the accumulative amount of newly added customer sequences exceed a safety bound, which depends on database size. The proposed approach thus becomes efficiently and effectively for handling newly added customer sequences.

原文English
主出版物標題Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC
頁面3991-3996
頁數6
DOIs
出版狀態Published - 2008 十二月 23
事件7th International Conference on Machine Learning and Cybernetics, ICMLC - Kunming, China
持續時間: 2008 七月 122008 七月 15

出版系列

名字Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC
7

Other

Other7th International Conference on Machine Learning and Cybernetics, ICMLC
國家China
城市Kunming
期間08-07-1208-07-15

指紋

Association rules

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Human-Computer Interaction
  • Control and Systems Engineering

引用此文

Hong, T. P., Chen, H. Y., Lin, C. W., & Li, S-T. (2008). Incrementally fast updated sequential pattern trees. 於 Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC (頁 3991-3996). [4621100] (Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC; 卷 7). https://doi.org/10.1109/ICMLC.2008.4621100
Hong, Tzung Pei ; Chen, Hsin Yi ; Lin, Chun Wei ; Li, Sheng-Tun. / Incrementally fast updated sequential pattern trees. Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC. 2008. 頁 3991-3996 (Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC).
@inproceedings{01b00caec6a3408fa9f517414a3904e6,
title = "Incrementally fast updated sequential pattern trees",
abstract = "In the past, the FUFP-tree maintenance algorithm is proposed to efficiently handle the association rules in incremental mining. In this paper, we attempt to modify the FUFP-tree maintenance algorithm for maintaining sequential patterns based on the concept of pre-large sequences to reduce the need for rescanning original databases in incremental mining. A fast updated sequential pattern trees (FUSP trees) structure and the maintenance algorithm are proposed, which makes the tree update process become easier. It does not require rescanning original customer sequences until the accumulative amount of newly added customer sequences exceed a safety bound, which depends on database size. The proposed approach thus becomes efficiently and effectively for handling newly added customer sequences.",
author = "Hong, {Tzung Pei} and Chen, {Hsin Yi} and Lin, {Chun Wei} and Sheng-Tun Li",
year = "2008",
month = "12",
day = "23",
doi = "10.1109/ICMLC.2008.4621100",
language = "English",
isbn = "9781424420964",
series = "Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC",
pages = "3991--3996",
booktitle = "Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC",

}

Hong, TP, Chen, HY, Lin, CW & Li, S-T 2008, Incrementally fast updated sequential pattern trees. 於 Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC., 4621100, Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC, 卷 7, 頁 3991-3996, 7th International Conference on Machine Learning and Cybernetics, ICMLC, Kunming, China, 08-07-12. https://doi.org/10.1109/ICMLC.2008.4621100

Incrementally fast updated sequential pattern trees. / Hong, Tzung Pei; Chen, Hsin Yi; Lin, Chun Wei; Li, Sheng-Tun.

Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC. 2008. p. 3991-3996 4621100 (Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC; 卷 7).

研究成果: Conference contribution

TY - GEN

T1 - Incrementally fast updated sequential pattern trees

AU - Hong, Tzung Pei

AU - Chen, Hsin Yi

AU - Lin, Chun Wei

AU - Li, Sheng-Tun

PY - 2008/12/23

Y1 - 2008/12/23

N2 - In the past, the FUFP-tree maintenance algorithm is proposed to efficiently handle the association rules in incremental mining. In this paper, we attempt to modify the FUFP-tree maintenance algorithm for maintaining sequential patterns based on the concept of pre-large sequences to reduce the need for rescanning original databases in incremental mining. A fast updated sequential pattern trees (FUSP trees) structure and the maintenance algorithm are proposed, which makes the tree update process become easier. It does not require rescanning original customer sequences until the accumulative amount of newly added customer sequences exceed a safety bound, which depends on database size. The proposed approach thus becomes efficiently and effectively for handling newly added customer sequences.

AB - In the past, the FUFP-tree maintenance algorithm is proposed to efficiently handle the association rules in incremental mining. In this paper, we attempt to modify the FUFP-tree maintenance algorithm for maintaining sequential patterns based on the concept of pre-large sequences to reduce the need for rescanning original databases in incremental mining. A fast updated sequential pattern trees (FUSP trees) structure and the maintenance algorithm are proposed, which makes the tree update process become easier. It does not require rescanning original customer sequences until the accumulative amount of newly added customer sequences exceed a safety bound, which depends on database size. The proposed approach thus becomes efficiently and effectively for handling newly added customer sequences.

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

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

U2 - 10.1109/ICMLC.2008.4621100

DO - 10.1109/ICMLC.2008.4621100

M3 - Conference contribution

AN - SCOPUS:57749110830

SN - 9781424420964

T3 - Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC

SP - 3991

EP - 3996

BT - Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC

ER -

Hong TP, Chen HY, Lin CW, Li S-T. Incrementally fast updated sequential pattern trees. 於 Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC. 2008. p. 3991-3996. 4621100. (Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC). https://doi.org/10.1109/ICMLC.2008.4621100