利用多目标粒子群算法从不确定数据库中发现潜在高效用项目集

L. K., Raja Sathasivam, S. P., D. R, P. K R, M. Sj, Gunasekar M, M. Sd
{"title":"利用多目标粒子群算法从不确定数据库中发现潜在高效用项目集","authors":"L. K., Raja Sathasivam, S. P., D. R, P. K R, M. Sj, Gunasekar M, M. Sd","doi":"10.1109/ICACTA54488.2022.9753159","DOIUrl":null,"url":null,"abstract":"In recent decades, Internet of Things devices have grown in popularity across a wide range of industries and uses. As a result, vast amounts of data are created and generated. Despite the fact that the collected data contains a great quantity of crucial information, most current and general pattern mining algorithms simply analyses a single item and exact information to identify the needed data. Because the amount of data gathered is so huge, it is vital to identify meaningful and updated data in a short period of time. In this paper, we use a multi-objective evolutionary framework to effectively mine the interesting Potential High Utility Itemset (PHUI) in a limited period, with the majority of items being PHUI utility and uncertainty. In an unpredictable context, the benefits of the proposed model (dubbed MOPSO-PHUIM) can identify lucrative PHUIs without pre-defined threshold values (i.e., minimal utility and minimum uncertainty). To illustrate the efficiency of the created MOPSO-PHUIM, two encoding techniques are also taken into account. Using the developed MOPSO-PHUIM model for decision-making, a set of non-dominated PHUIs may be found in a short amount of time. Studies are then carried out to demonstrate the utility and performance of the built MOPSO-PHUIM model in terms of velocity, hyper volume, and the different result discovered when compared to generic techniques.","PeriodicalId":345370,"journal":{"name":"2022 International Conference on Advanced Computing Technologies and Applications (ICACTA)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Discovery of Potential High Utility Itemset from Uncertain Database using Multi Objective Particle Swarm Optimization Algorithm\",\"authors\":\"L. K., Raja Sathasivam, S. P., D. R, P. K R, M. Sj, Gunasekar M, M. Sd\",\"doi\":\"10.1109/ICACTA54488.2022.9753159\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent decades, Internet of Things devices have grown in popularity across a wide range of industries and uses. As a result, vast amounts of data are created and generated. Despite the fact that the collected data contains a great quantity of crucial information, most current and general pattern mining algorithms simply analyses a single item and exact information to identify the needed data. Because the amount of data gathered is so huge, it is vital to identify meaningful and updated data in a short period of time. In this paper, we use a multi-objective evolutionary framework to effectively mine the interesting Potential High Utility Itemset (PHUI) in a limited period, with the majority of items being PHUI utility and uncertainty. In an unpredictable context, the benefits of the proposed model (dubbed MOPSO-PHUIM) can identify lucrative PHUIs without pre-defined threshold values (i.e., minimal utility and minimum uncertainty). To illustrate the efficiency of the created MOPSO-PHUIM, two encoding techniques are also taken into account. Using the developed MOPSO-PHUIM model for decision-making, a set of non-dominated PHUIs may be found in a short amount of time. Studies are then carried out to demonstrate the utility and performance of the built MOPSO-PHUIM model in terms of velocity, hyper volume, and the different result discovered when compared to generic techniques.\",\"PeriodicalId\":345370,\"journal\":{\"name\":\"2022 International Conference on Advanced Computing Technologies and Applications (ICACTA)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Advanced Computing Technologies and Applications (ICACTA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACTA54488.2022.9753159\",\"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 International Conference on Advanced Computing Technologies and Applications (ICACTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACTA54488.2022.9753159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近几十年来,物联网设备在广泛的行业和用途中越来越受欢迎。因此,大量的数据被创建和生成。尽管收集到的数据包含了大量的关键信息,但大多数当前和通用的模式挖掘算法只是简单地分析单个项目和精确的信息来识别所需的数据。由于收集的数据量非常大,因此在短时间内识别有意义的和更新的数据至关重要。在本文中,我们使用一个多目标进化框架来有效地挖掘有限时间内有趣的潜在高效用项目集(PHUI),其中大多数项目是PHUI的效用和不确定性。在不可预测的上下文中,所提出的模型(称为MOPSO-PHUIM)的好处可以在没有预定义阈值(即最小效用和最小不确定性)的情况下识别有利可图的phui。为了说明所创建的MOPSO-PHUIM的效率,还考虑了两种编码技术。利用所建立的MOPSO-PHUIM模型进行决策,可以在短时间内找到一组非支配型phui。然后进行研究,以证明所建立的MOPSO-PHUIM模型在速度,超体积方面的效用和性能,以及与通用技术相比发现的不同结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Discovery of Potential High Utility Itemset from Uncertain Database using Multi Objective Particle Swarm Optimization Algorithm
In recent decades, Internet of Things devices have grown in popularity across a wide range of industries and uses. As a result, vast amounts of data are created and generated. Despite the fact that the collected data contains a great quantity of crucial information, most current and general pattern mining algorithms simply analyses a single item and exact information to identify the needed data. Because the amount of data gathered is so huge, it is vital to identify meaningful and updated data in a short period of time. In this paper, we use a multi-objective evolutionary framework to effectively mine the interesting Potential High Utility Itemset (PHUI) in a limited period, with the majority of items being PHUI utility and uncertainty. In an unpredictable context, the benefits of the proposed model (dubbed MOPSO-PHUIM) can identify lucrative PHUIs without pre-defined threshold values (i.e., minimal utility and minimum uncertainty). To illustrate the efficiency of the created MOPSO-PHUIM, two encoding techniques are also taken into account. Using the developed MOPSO-PHUIM model for decision-making, a set of non-dominated PHUIs may be found in a short amount of time. Studies are then carried out to demonstrate the utility and performance of the built MOPSO-PHUIM model in terms of velocity, hyper volume, and the different result discovered when compared to generic techniques.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Building Dynamic permutation based Privacy Preservation Model with Block Chain Technology for IoT Healthcare Sector DCNET: A Novel Implementation of Gastric Cancer Detection System through Deep Learning Convolution Networks Customer Segmentation Based on Sentimental Analysis Pigment Epithelial Detachment Detection: A Review of Imaging Techniques and Algorithms Soft Computing based Brain Tumor Categorization with Machine Learning Techniques
×
引用
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