Maintaining pre-large FUSP trees for record deletion

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

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

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009
Pages948-953
Number of pages6
DOIs
Publication statusPublished - 2009 Nov 20
Event2009 International Conference on New Trends in Information and Service Science, NISS 2009 - Beijing, China
Duration: 2009 Jun 302009 Jul 2

Publication series

NameProceedings - 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
CountryChina
CityBeijing
Period09-06-3009-07-02

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

Fingerprint Dive into the research topics of 'Maintaining pre-large FUSP trees for record deletion'. Together they form a unique fingerprint.

Cite this