一种快速有效的基于树的高实用项集提取技术

Subba Reddy Meruva, B. Venkateswarlu
{"title":"一种快速有效的基于树的高实用项集提取技术","authors":"Subba Reddy Meruva, B. Venkateswarlu","doi":"10.1109/ICECA55336.2022.10009213","DOIUrl":null,"url":null,"abstract":"The most important phase in the discovery of common item-sets is identifying relationships between the items. Frequent-pattern growth (FP-growth), one of the traditional association mining techniques, excels at generating frequent item sets. For the purpose of eliminating item sets with high infrequency, both mining algorithms employ the support-confidence framework. Due to its inability to take into account the affected utility element, the support-confidence framework falls short in important applications including e-commerce, web mining, and healthcare. For circumvent the drawbacks of conventional algorithms, utility-based mining methods must be developed. Utility-based mining algorithms have recently developed with the significant advancements in association mining. For the purpose of performing active utility mining, the proposed technique is described. It employed the utility mining algorithms by tree structure building. The experimental section shows experimental findings from benchmark datasets and illustrates the effectiveness of the proposed methodology.","PeriodicalId":356949,"journal":{"name":"2022 6th International Conference on Electronics, Communication and Aerospace Technology","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Fast and Effective Tree-based Mining Technique for Extraction of High Utility Itemsets\",\"authors\":\"Subba Reddy Meruva, B. Venkateswarlu\",\"doi\":\"10.1109/ICECA55336.2022.10009213\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The most important phase in the discovery of common item-sets is identifying relationships between the items. Frequent-pattern growth (FP-growth), one of the traditional association mining techniques, excels at generating frequent item sets. For the purpose of eliminating item sets with high infrequency, both mining algorithms employ the support-confidence framework. Due to its inability to take into account the affected utility element, the support-confidence framework falls short in important applications including e-commerce, web mining, and healthcare. For circumvent the drawbacks of conventional algorithms, utility-based mining methods must be developed. Utility-based mining algorithms have recently developed with the significant advancements in association mining. For the purpose of performing active utility mining, the proposed technique is described. It employed the utility mining algorithms by tree structure building. The experimental section shows experimental findings from benchmark datasets and illustrates the effectiveness of the proposed methodology.\",\"PeriodicalId\":356949,\"journal\":{\"name\":\"2022 6th International Conference on Electronics, Communication and Aerospace Technology\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 6th International Conference on Electronics, Communication and Aerospace Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECA55336.2022.10009213\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 6th International Conference on Electronics, Communication and Aerospace Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECA55336.2022.10009213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在发现公共项集的过程中,最重要的阶段是确定项之间的关系。高频模式增长(FP-growth)是传统的关联挖掘技术之一,擅长生成频繁项集。为了消除高频项集,两种挖掘算法都采用了支持置信度框架。由于无法考虑受影响的效用因素,支持信心框架在电子商务、web挖掘和医疗保健等重要应用中存在不足。为了克服传统算法的缺陷,必须开发基于效用的挖掘方法。基于效用的挖掘算法最近随着关联挖掘的显著进步而发展。为了进行主动效用挖掘,本文描述了所提出的技术。采用树形结构构建的效用挖掘算法。实验部分展示了基准数据集的实验结果,并说明了所提出方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Fast and Effective Tree-based Mining Technique for Extraction of High Utility Itemsets
The most important phase in the discovery of common item-sets is identifying relationships between the items. Frequent-pattern growth (FP-growth), one of the traditional association mining techniques, excels at generating frequent item sets. For the purpose of eliminating item sets with high infrequency, both mining algorithms employ the support-confidence framework. Due to its inability to take into account the affected utility element, the support-confidence framework falls short in important applications including e-commerce, web mining, and healthcare. For circumvent the drawbacks of conventional algorithms, utility-based mining methods must be developed. Utility-based mining algorithms have recently developed with the significant advancements in association mining. For the purpose of performing active utility mining, the proposed technique is described. It employed the utility mining algorithms by tree structure building. The experimental section shows experimental findings from benchmark datasets and illustrates the effectiveness of the proposed methodology.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multi-Objective Artificial Flora Algorithm Based Optimal Handover Scheme for LTE-Advanced Networks Named Entity Recognition using CRF with Active Learning Algorithm in English Texts FPGA Implementation of Lattice-Wave Half-Order Digital Integrator using Radix-$2^{r}$ Digit Recoding Green Cloud Computing- Next Step Towards Eco-friendly Work Stations Diabetes Prediction using Support Vector Machine, Naive Bayes and Random Forest Machine Learning Models
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1