面向电子商务的高效、高效用模式挖掘算法

M. M. Bala, Rohit Dandamudi
{"title":"面向电子商务的高效、高效用模式挖掘算法","authors":"M. M. Bala, Rohit Dandamudi","doi":"10.1109/IADCC.2018.8691944","DOIUrl":null,"url":null,"abstract":"Utility pattern mining addresses the current common challenges of E-business by analysis of market behavior and customer trends of transactional data. However, it has some important limitations when it comes to analyzing customer transactions in any business as buying quantities are not considered into account. Thus, it leads to misappropriate analysis due to consideration of an item may only appear once or zero times in a transaction data and a weight of all item have given same importance. To address the above said confines, the problem of identification of frequent set of items as patterns has been defined in E business as High Utility Pattern Mining (HUPM). The focus of this paper is finding high utility patterns by using weighted utilization value of each product. This is implemented in two modules finding top k high utility patterns by constructing UP growth tree and TKU algorithm and finding top-k utilities in one phase approach with TKO algorithm to mine HUPs without any assumptions of minimum utility threshold. Experimental results show that the proposed algorithms take a smaller amount of computational cost, thus it shows more efficiency once compared with other present methods on standard data sets.","PeriodicalId":365713,"journal":{"name":"2018 IEEE 8th International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"HUPM: Efficient High Utility Pattern Mining Algorithm for E-Business\",\"authors\":\"M. M. Bala, Rohit Dandamudi\",\"doi\":\"10.1109/IADCC.2018.8691944\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Utility pattern mining addresses the current common challenges of E-business by analysis of market behavior and customer trends of transactional data. However, it has some important limitations when it comes to analyzing customer transactions in any business as buying quantities are not considered into account. Thus, it leads to misappropriate analysis due to consideration of an item may only appear once or zero times in a transaction data and a weight of all item have given same importance. To address the above said confines, the problem of identification of frequent set of items as patterns has been defined in E business as High Utility Pattern Mining (HUPM). The focus of this paper is finding high utility patterns by using weighted utilization value of each product. This is implemented in two modules finding top k high utility patterns by constructing UP growth tree and TKU algorithm and finding top-k utilities in one phase approach with TKO algorithm to mine HUPs without any assumptions of minimum utility threshold. Experimental results show that the proposed algorithms take a smaller amount of computational cost, thus it shows more efficiency once compared with other present methods on standard data sets.\",\"PeriodicalId\":365713,\"journal\":{\"name\":\"2018 IEEE 8th International Advance Computing Conference (IACC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 8th International Advance Computing Conference (IACC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IADCC.2018.8691944\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 8th International Advance Computing Conference (IACC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IADCC.2018.8691944","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

效用模式挖掘通过分析交易数据的市场行为和客户趋势来解决当前电子商务的共同挑战。然而,当涉及到分析任何业务中的客户交易时,它有一些重要的局限性,因为购买数量没有被考虑在内。因此,由于考虑一个项目可能在交易数据中只出现一次或零次,并且所有项目的权重都具有相同的重要性,因此导致分析不当。为了解决上述限制,在电子商务中将频繁的项目集识别为模式的问题定义为高效用模式挖掘(High Utility Pattern Mining, HUPM)。本文的重点是利用各产品的加权利用值来寻找高效用模式。这在两个模块中实现,通过构建UP增长树和TKU算法找到top k高效用模式,使用TKO算法在一阶段方法中找到top-k效用,在不假设最小效用阈值的情况下挖掘HUPs。实验结果表明,该算法的计算量较小,在标准数据集上与现有方法相比具有更高的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
HUPM: Efficient High Utility Pattern Mining Algorithm for E-Business
Utility pattern mining addresses the current common challenges of E-business by analysis of market behavior and customer trends of transactional data. However, it has some important limitations when it comes to analyzing customer transactions in any business as buying quantities are not considered into account. Thus, it leads to misappropriate analysis due to consideration of an item may only appear once or zero times in a transaction data and a weight of all item have given same importance. To address the above said confines, the problem of identification of frequent set of items as patterns has been defined in E business as High Utility Pattern Mining (HUPM). The focus of this paper is finding high utility patterns by using weighted utilization value of each product. This is implemented in two modules finding top k high utility patterns by constructing UP growth tree and TKU algorithm and finding top-k utilities in one phase approach with TKO algorithm to mine HUPs without any assumptions of minimum utility threshold. Experimental results show that the proposed algorithms take a smaller amount of computational cost, thus it shows more efficiency once compared with other present methods on standard data sets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信