Maintaining high utility pattern trees in dynamic databases

Chun Wei Lin, Tzung Pei Hong, Wen Hsiang Lu

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

6 Citations (Scopus)

Abstract

We have previously proposed the high utility pattern (HUP) tree for utility mining. In this paper, we further handle the problem of maintaining the HUP tree in dynamic databases. A HUP maintenance algorithm has thus been proposed for efficiently handling new transactions. The proposed algorithm can reduce the cost of re-constructing the HUP tree when new transactions are inserted. Experimental results also show that it indeed executes faster than the batch maintenance algorithm and generates nearly the same tree structure as the batch one. The proposed maintenance algorithm can thus achieve a good trade-off between execution time and tree complexity.

Original languageEnglish
Title of host publication2010 2nd International Conference on Computer Engineering and Applications, ICCEA 2010
Pages304-308
Number of pages5
DOIs
Publication statusPublished - 2010 May 28
Event2nd International Conference on Computer Engineering and Applications, ICCEA 2010 - , Indonesia
Duration: 2010 Mar 192010 Mar 21

Publication series

Name2010 2nd International Conference on Computer Engineering and Applications, ICCEA 2010
Volume1

Other

Other2nd International Conference on Computer Engineering and Applications, ICCEA 2010
CountryIndonesia
Period10-03-1910-03-21

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

Fingerprint Dive into the research topics of 'Maintaining high utility pattern trees in dynamic databases'. Together they form a unique fingerprint.

Cite this