动态数据库中高实用模式树的维护

Chun-Wei Lin, T. Hong, Wen-Hsiang Lu
{"title":"动态数据库中高实用模式树的维护","authors":"Chun-Wei Lin, T. Hong, Wen-Hsiang Lu","doi":"10.1109/ICCEA.2010.67","DOIUrl":null,"url":null,"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.","PeriodicalId":207234,"journal":{"name":"2010 Second International Conference on Computer Engineering and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Maintaining High Utility Pattern Trees in Dynamic Databases\",\"authors\":\"Chun-Wei Lin, T. Hong, Wen-Hsiang Lu\",\"doi\":\"10.1109/ICCEA.2010.67\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":207234,\"journal\":{\"name\":\"2010 Second International Conference on Computer Engineering and Applications\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Computer Engineering and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCEA.2010.67\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Computer Engineering and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCEA.2010.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

我们之前提出了用于效用挖掘的高效用模式(HUP)树。本文进一步研究了动态数据库中HUP树的维护问题。因此,提出了一种HUP维护算法来有效地处理新事务。该算法可以减少插入新事务时重新构建HUP树的开销。实验结果也表明,该算法的执行速度确实快于批处理维护算法,并且生成的树结构与批处理维护算法几乎相同。因此,所提出的维护算法可以在执行时间和树复杂度之间实现良好的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Maintaining High Utility Pattern Trees in Dynamic Databases
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信