在动态数据库中维护高实用项目集

Chun-Wei Lin, Wensheng Gan, T. Hong, Chien‐Ming Chen
{"title":"在动态数据库中维护高实用项目集","authors":"Chun-Wei Lin, Wensheng Gan, T. Hong, Chien‐Ming Chen","doi":"10.1109/ICMLC.2014.7009653","DOIUrl":null,"url":null,"abstract":"Utility mining is used to measure the utility values of the purchased items from transactional database. It usually considers not only the occurrence frequencies of items but also the factors of profit, cost and quantity. In the past, many algorithms were proposed to mine high-utility itemsets from a static database. In real-world applications, transactions are usually inserted, deleted or modified in dynamic databases. In this paper, we propose a maintenance algorithm to handle transaction modification for efficiently updating the discovered high-utility itemsets. Experiments are conducted to show that the proposed approach has better performance than the two-phase algorithm in batch mode.","PeriodicalId":335296,"journal":{"name":"2014 International Conference on Machine Learning and Cybernetics","volume":"149 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Maintaining high-utility itemsets in dynamic databases\",\"authors\":\"Chun-Wei Lin, Wensheng Gan, T. Hong, Chien‐Ming Chen\",\"doi\":\"10.1109/ICMLC.2014.7009653\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Utility mining is used to measure the utility values of the purchased items from transactional database. It usually considers not only the occurrence frequencies of items but also the factors of profit, cost and quantity. In the past, many algorithms were proposed to mine high-utility itemsets from a static database. In real-world applications, transactions are usually inserted, deleted or modified in dynamic databases. In this paper, we propose a maintenance algorithm to handle transaction modification for efficiently updating the discovered high-utility itemsets. Experiments are conducted to show that the proposed approach has better performance than the two-phase algorithm in batch mode.\",\"PeriodicalId\":335296,\"journal\":{\"name\":\"2014 International Conference on Machine Learning and Cybernetics\",\"volume\":\"149 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Machine Learning and Cybernetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMLC.2014.7009653\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Machine Learning and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLC.2014.7009653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

效用挖掘用于度量从事务数据库购买的物品的效用值。它通常不仅考虑项目的出现频率,还考虑利润、成本和数量等因素。过去,提出了许多从静态数据库中挖掘高效用项集的算法。在实际应用程序中,事务通常在动态数据库中插入、删除或修改。在本文中,我们提出了一种维护算法来处理事务修改,以有效地更新发现的高效用项集。实验结果表明,该方法在批处理模式下具有比两阶段算法更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Maintaining high-utility itemsets in dynamic databases
Utility mining is used to measure the utility values of the purchased items from transactional database. It usually considers not only the occurrence frequencies of items but also the factors of profit, cost and quantity. In the past, many algorithms were proposed to mine high-utility itemsets from a static database. In real-world applications, transactions are usually inserted, deleted or modified in dynamic databases. In this paper, we propose a maintenance algorithm to handle transaction modification for efficiently updating the discovered high-utility itemsets. Experiments are conducted to show that the proposed approach has better performance than the two-phase algorithm in batch mode.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信