基于树的模糊平均效用挖掘算法

T. Hong, Meng-Ping Ku, Wei-Ming Huang, Shu-Min Li, Chun-Wei Lin
{"title":"基于树的模糊平均效用挖掘算法","authors":"T. Hong, Meng-Ping Ku, Wei-Ming Huang, Shu-Min Li, Chun-Wei Lin","doi":"10.1109/ICDMW51313.2020.00094","DOIUrl":null,"url":null,"abstract":"Utility mining considers high-utility itemsets as useful by combining item quantities and item benefits. Its mining results do not, however, include the quantity information such as large amounts or small amounts. Fuzzy utility mining is thus proposed to fuzzify the results of utility mining and obtain linguistic high-utility itemsets. However, fuzzy utility measurement is not fair to evaluate itemsets because the fuzzy utility value of an itemset in a transaction may be higher than those of its subsets. In the past, we defined the fuzzy average utility mining to solve the above problem and proposed a two-phase method to solve the fuzzy average-utility mining problem and find high fuzzy average-utility itemsets. However, its execution is slow. In this paper, an efficient algorithm is proposed, which uses a tree structure to solve fuzzy average-utility mining. The proposed tree-structure method is compared with the previous two-phase approach. Experimental evaluation shows that the efficiency of the proposed method is better than that of the two-phase algorithm in execution time and numbers of candidates.","PeriodicalId":426846,"journal":{"name":"2020 International Conference on Data Mining Workshops (ICDMW)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Tree-based Fuzzy Average-Utility Mining Algorithm\",\"authors\":\"T. Hong, Meng-Ping Ku, Wei-Ming Huang, Shu-Min Li, Chun-Wei Lin\",\"doi\":\"10.1109/ICDMW51313.2020.00094\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Utility mining considers high-utility itemsets as useful by combining item quantities and item benefits. Its mining results do not, however, include the quantity information such as large amounts or small amounts. Fuzzy utility mining is thus proposed to fuzzify the results of utility mining and obtain linguistic high-utility itemsets. However, fuzzy utility measurement is not fair to evaluate itemsets because the fuzzy utility value of an itemset in a transaction may be higher than those of its subsets. In the past, we defined the fuzzy average utility mining to solve the above problem and proposed a two-phase method to solve the fuzzy average-utility mining problem and find high fuzzy average-utility itemsets. However, its execution is slow. In this paper, an efficient algorithm is proposed, which uses a tree structure to solve fuzzy average-utility mining. The proposed tree-structure method is compared with the previous two-phase approach. Experimental evaluation shows that the efficiency of the proposed method is better than that of the two-phase algorithm in execution time and numbers of candidates.\",\"PeriodicalId\":426846,\"journal\":{\"name\":\"2020 International Conference on Data Mining Workshops (ICDMW)\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Data Mining Workshops (ICDMW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDMW51313.2020.00094\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Data Mining Workshops (ICDMW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMW51313.2020.00094","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

效用挖掘通过结合物品数量和物品收益来考虑高效用的物品集。但其挖掘结果不包含大量或少量等数量信息。因此,提出了模糊效用挖掘,将效用挖掘的结果模糊化,获得语言高效用项集。然而,模糊效用度量对于评估项目集是不公平的,因为事务中一个项目集的模糊效用值可能高于它的子集。在过去,我们定义了模糊平均效用挖掘来解决上述问题,并提出了一种两阶段的方法来解决模糊平均效用挖掘问题,并找到高模糊平均效用项集。然而,它的执行速度很慢。本文提出了一种利用树形结构求解模糊平均效用挖掘的高效算法。将所提出的树状结构方法与两阶段方法进行了比较。实验结果表明,该方法在执行时间和候选对象数量上均优于两阶段算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Tree-based Fuzzy Average-Utility Mining Algorithm
Utility mining considers high-utility itemsets as useful by combining item quantities and item benefits. Its mining results do not, however, include the quantity information such as large amounts or small amounts. Fuzzy utility mining is thus proposed to fuzzify the results of utility mining and obtain linguistic high-utility itemsets. However, fuzzy utility measurement is not fair to evaluate itemsets because the fuzzy utility value of an itemset in a transaction may be higher than those of its subsets. In the past, we defined the fuzzy average utility mining to solve the above problem and proposed a two-phase method to solve the fuzzy average-utility mining problem and find high fuzzy average-utility itemsets. However, its execution is slow. In this paper, an efficient algorithm is proposed, which uses a tree structure to solve fuzzy average-utility mining. The proposed tree-structure method is compared with the previous two-phase approach. Experimental evaluation shows that the efficiency of the proposed method is better than that of the two-phase algorithm in execution time and numbers of candidates.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信