Maintaining high utility pattern trees in dynamic databases

Chun Wei Lin, Tzung Pei Hong, Wen Hsiang Lu

研究成果: Conference contribution

6 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題2010 2nd International Conference on Computer Engineering and Applications, ICCEA 2010
頁面304-308
頁數5
DOIs
出版狀態Published - 2010 五月 28
事件2nd International Conference on Computer Engineering and Applications, ICCEA 2010 - , Indonesia
持續時間: 2010 三月 192010 三月 21

出版系列

名字2010 2nd International Conference on Computer Engineering and Applications, ICCEA 2010
1

Other

Other2nd International Conference on Computer Engineering and Applications, ICCEA 2010
國家Indonesia
期間10-03-1910-03-21

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

指紋 深入研究「Maintaining high utility pattern trees in dynamic databases」主題。共同形成了獨特的指紋。

引用此