Mining correlated high-utility itemsets using various measures

Log. J. IGPL Pub Date : 2020-01-24 DOI:10.1093/jigpal/jzz068
Philippe Fournier-Viger, Yimin Zhang, Jerry Chun‐wei Lin, Duy-Tai Dinh, H. Le
{"title":"Mining correlated high-utility itemsets using various measures","authors":"Philippe Fournier-Viger, Yimin Zhang, Jerry Chun‐wei Lin, Duy-Tai Dinh, H. Le","doi":"10.1093/jigpal/jzz068","DOIUrl":null,"url":null,"abstract":"Discovering high-utility itemsets consists of finding sets of items that yield a high profit in customer transaction databases. An important limitation of traditional high-utility itemset mining is that only the utility measure is used for assessing the interestingness of patterns. This leads to finding several itemsets that have a high profit but contain items that are weakly correlated. To address this issue, this paper proposes to integrate the concept of correlation in high-utility itemset mining to find profitable itemsets that are highly correlated, using the all-confidence and bond measures. An efficient algorithm named FCHM (Fast Correlated High-utility itemset Miner) is proposed to efficiently discover correlated high-utility itemsets. Two versions of the algorithm are proposed, named FCHMall-confidence and FCHMbond based on the allconfidence and bond measures, respectively. An experimental evaluation was done using four real-life benchmark datasets from the high-utility itemset mining litterature: mushroom, retail, kosarak and foodmart. Results show that FCHM is efficient and can prune a huge amount of weakly correlated high-utility itemsets.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"s3-41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Log. J. IGPL","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/jigpal/jzz068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

Abstract

Discovering high-utility itemsets consists of finding sets of items that yield a high profit in customer transaction databases. An important limitation of traditional high-utility itemset mining is that only the utility measure is used for assessing the interestingness of patterns. This leads to finding several itemsets that have a high profit but contain items that are weakly correlated. To address this issue, this paper proposes to integrate the concept of correlation in high-utility itemset mining to find profitable itemsets that are highly correlated, using the all-confidence and bond measures. An efficient algorithm named FCHM (Fast Correlated High-utility itemset Miner) is proposed to efficiently discover correlated high-utility itemsets. Two versions of the algorithm are proposed, named FCHMall-confidence and FCHMbond based on the allconfidence and bond measures, respectively. An experimental evaluation was done using four real-life benchmark datasets from the high-utility itemset mining litterature: mushroom, retail, kosarak and foodmart. Results show that FCHM is efficient and can prune a huge amount of weakly correlated high-utility itemsets.
使用各种度量方法挖掘相关的高效用项集
发现高效用项目集包括发现在客户事务数据库中产生高利润的项目集。传统的高效用项集挖掘的一个重要限制是,仅使用效用度量来评估模式的兴趣性。这将导致找到几个具有高利润但包含弱相关项目的项目集。为了解决这一问题,本文提出在高效用项目集挖掘中整合相关性的概念,利用全置信度和债券度量来寻找高度相关的有利可图的项目集。提出了一种快速相关高效用项集挖掘算法(FCHM),用于高效地发现相关高效用项集。提出了基于全置信度和键测度的FCHMall-confidence和FCHMbond两种算法版本。实验评估使用了来自高效用项目集挖掘文献的四个现实生活基准数据集:蘑菇、零售、kosarak和foodmart。结果表明,FCHM是有效的,可以对大量弱相关的高效用项集进行修剪。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信