一种新的基于混合机器学习的事务性数据库频繁项提取方法

D. Rao, V. Sucharita
{"title":"一种新的基于混合机器学习的事务性数据库频繁项提取方法","authors":"D. Rao, V. Sucharita","doi":"10.1142/s1793962323410064","DOIUrl":null,"url":null,"abstract":"In big data, the frequent item set mining is an important framework for many applications. Several techniques were used to mine the frequent item sets, but for the collapsed and complex data, it is difficult. Hence, the current research work aimed to model a novel Frequent Pattern Growth-Hybrid Ant Colony and African Buffalo Model (FPG-HACABM) is developed to overcome this issue and to reduce the execution time. Moreover, the Fitness function of HACABM is utilized to calculate the support count of each item and to improve the classification accuracy. Thus the proposed models classify the frequently utilized items accurately and arranged those items in descending order. This helps to run the big data transactional application effectively without any delay. Finally, the key metrics are validated with the existing models and better results are attained by achieving a high accuracy rate of 99.82% and less execution time of 0.0018 ms.","PeriodicalId":13657,"journal":{"name":"Int. J. Model. Simul. Sci. Comput.","volume":"58 1","pages":"2341006:1-2341006:21"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel hybrid machine learning-based frequent item extraction for transactional database\",\"authors\":\"D. Rao, V. Sucharita\",\"doi\":\"10.1142/s1793962323410064\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In big data, the frequent item set mining is an important framework for many applications. Several techniques were used to mine the frequent item sets, but for the collapsed and complex data, it is difficult. Hence, the current research work aimed to model a novel Frequent Pattern Growth-Hybrid Ant Colony and African Buffalo Model (FPG-HACABM) is developed to overcome this issue and to reduce the execution time. Moreover, the Fitness function of HACABM is utilized to calculate the support count of each item and to improve the classification accuracy. Thus the proposed models classify the frequently utilized items accurately and arranged those items in descending order. This helps to run the big data transactional application effectively without any delay. Finally, the key metrics are validated with the existing models and better results are attained by achieving a high accuracy rate of 99.82% and less execution time of 0.0018 ms.\",\"PeriodicalId\":13657,\"journal\":{\"name\":\"Int. J. Model. Simul. Sci. Comput.\",\"volume\":\"58 1\",\"pages\":\"2341006:1-2341006:21\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-02-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Model. Simul. Sci. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s1793962323410064\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Model. Simul. Sci. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s1793962323410064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在大数据中,频繁项集挖掘是许多应用的重要框架。频繁项集的挖掘采用了多种技术,但对于折叠和复杂的数据,挖掘难度较大。因此,本研究旨在建立一种新的频繁模式生长-混合蚁群和非洲水牛模型(fpga - hacabm)来克服这一问题,并缩短执行时间。此外,利用HACABM的适应度函数计算每个条目的支持度,提高分类精度。因此,所提出的模型可以准确地对频繁使用的项目进行分类,并将这些项目按降序排列。这有助于在没有任何延迟的情况下有效地运行大数据事务应用程序。最后,利用现有模型对关键指标进行验证,准确率达到99.82%,执行时间缩短至0.0018 ms,取得了较好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A novel hybrid machine learning-based frequent item extraction for transactional database
In big data, the frequent item set mining is an important framework for many applications. Several techniques were used to mine the frequent item sets, but for the collapsed and complex data, it is difficult. Hence, the current research work aimed to model a novel Frequent Pattern Growth-Hybrid Ant Colony and African Buffalo Model (FPG-HACABM) is developed to overcome this issue and to reduce the execution time. Moreover, the Fitness function of HACABM is utilized to calculate the support count of each item and to improve the classification accuracy. Thus the proposed models classify the frequently utilized items accurately and arranged those items in descending order. This helps to run the big data transactional application effectively without any delay. Finally, the key metrics are validated with the existing models and better results are attained by achieving a high accuracy rate of 99.82% and less execution time of 0.0018 ms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Simulation of the drift and diffusion of marine oil spill under the effect of wind, current and tides Detection and recognition of dim and small targets in sea clutter background based on polarization decomposition Intelligent generation of combat simulation scenarios based on UML diagram recognition Visualization of relevant parameter dependencies in a delay SEIQ epidemic model - A live script program for didactic and interactive demonstrations A study on shipowner's behavior intention to cross dam by integrating SEM-SD model
×
引用
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