MSD-Apriori: Discovering borderline-rare items using association mining

Shikhar Kesarwani, Astha Goel, Neetu Sardana
{"title":"MSD-Apriori: Discovering borderline-rare items using association mining","authors":"Shikhar Kesarwani, Astha Goel, Neetu Sardana","doi":"10.1109/IC3.2017.8284319","DOIUrl":null,"url":null,"abstract":"Ecommerce business constantly decides innovative strategies to increase their sales and hence earn profit. They mainly strive to boost the sale of those items that are rarely purchased. There are few borderline-rare items that lie just below the minimum support threshold and may have a strong correlation with frequent items. The minimum support threshold is the user-defined minimum support value for an item. If these borderlinerare items are strategically placed in the market then it can help the e-commerce industry to improve their sales further. In this paper, we propose a hybrid approach, MSD-Apriori to discover borderline-rare elements which are below but close to minimum support threshold and have strong correlation with frequent items. The hybrid approach is formed by integrating MS Apriori with Dynamic Apriori. MS Apriori finds the borderline-rare item sets from the web logs and Dynamic Apriori discovers those items among these that share strong correlation with the frequent items by association rule mining. The proposed method is evaluated on Kosarak, a real dataset that gives encouraging results.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Tenth International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2017.8284319","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Ecommerce business constantly decides innovative strategies to increase their sales and hence earn profit. They mainly strive to boost the sale of those items that are rarely purchased. There are few borderline-rare items that lie just below the minimum support threshold and may have a strong correlation with frequent items. The minimum support threshold is the user-defined minimum support value for an item. If these borderlinerare items are strategically placed in the market then it can help the e-commerce industry to improve their sales further. In this paper, we propose a hybrid approach, MSD-Apriori to discover borderline-rare elements which are below but close to minimum support threshold and have strong correlation with frequent items. The hybrid approach is formed by integrating MS Apriori with Dynamic Apriori. MS Apriori finds the borderline-rare item sets from the web logs and Dynamic Apriori discovers those items among these that share strong correlation with the frequent items by association rule mining. The proposed method is evaluated on Kosarak, a real dataset that gives encouraging results.
MSD-Apriori:使用关联挖掘发现边缘稀有物品
电子商务企业不断决定创新的策略,以增加他们的销售,从而赚取利润。他们主要努力推动那些很少购买的商品的销售。很少有边缘稀有物品位于最低支持阈值以下,并且可能与频繁物品有很强的相关性。最小支持阈值是用户自定义的某项的最小支持值。如果这些边缘物品被战略性地放置在市场上,那么它可以帮助电子商务行业进一步提高他们的销售。在本文中,我们提出了一种混合方法MSD-Apriori来发现边界稀有元素,这些元素低于但接近最小支持阈值,并且与频繁项目有很强的相关性。混合方法是将MS Apriori和Dynamic Apriori相结合形成的。MS Apriori从web日志中发现边缘性罕见的条目集,Dynamic Apriori通过关联规则挖掘发现其中与频繁条目具有强相关性的条目集。在Kosarak真实数据集上对该方法进行了评估,得到了令人鼓舞的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信