基于RBF神经网络优化算法的数据关联规则挖掘方法

Tianyu Xia, Zhanghao Ye, Haoning Wu, Yiding Liu
{"title":"基于RBF神经网络优化算法的数据关联规则挖掘方法","authors":"Tianyu Xia, Zhanghao Ye, Haoning Wu, Yiding Liu","doi":"10.1109/CISCE50729.2020.00097","DOIUrl":null,"url":null,"abstract":"In order to achieve real-time and accurate data mining, this paper proposes a data association rules mining method based on RBF neural network optimization algorithm. On the basis of considering the constraint association rules, the data frequent itemsets are reduced to get the corresponding candidate data sets that meet the rules, and the update of the data frequent itemsets for user needs is completed. The candidate data set is input to RBF neural network for training, the network output is optimized by combining with rough set theory, the user demand data table and quadruple are constructed, the user demand attributes are described, and the user demand data is obtained by using upper bound pruning method. Through the upper bound pruning method, the user demand data is obtained and real-time mining is realized. Compared with other data mining algorithms, the simulation results show that the performance of the data mining algorithm proposed in this paper is less constrained by the proportion of redundant data and the size of data, the accuracy of data mining is higher, and it has better stability.","PeriodicalId":101777,"journal":{"name":"2020 International Conference on Communications, Information System and Computer Engineering (CISCE)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Data Association Rules Mining Method Based on RBF Neural Network Optimization Algorithm\",\"authors\":\"Tianyu Xia, Zhanghao Ye, Haoning Wu, Yiding Liu\",\"doi\":\"10.1109/CISCE50729.2020.00097\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to achieve real-time and accurate data mining, this paper proposes a data association rules mining method based on RBF neural network optimization algorithm. On the basis of considering the constraint association rules, the data frequent itemsets are reduced to get the corresponding candidate data sets that meet the rules, and the update of the data frequent itemsets for user needs is completed. The candidate data set is input to RBF neural network for training, the network output is optimized by combining with rough set theory, the user demand data table and quadruple are constructed, the user demand attributes are described, and the user demand data is obtained by using upper bound pruning method. Through the upper bound pruning method, the user demand data is obtained and real-time mining is realized. Compared with other data mining algorithms, the simulation results show that the performance of the data mining algorithm proposed in this paper is less constrained by the proportion of redundant data and the size of data, the accuracy of data mining is higher, and it has better stability.\",\"PeriodicalId\":101777,\"journal\":{\"name\":\"2020 International Conference on Communications, Information System and Computer Engineering (CISCE)\",\"volume\":\"140 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Communications, Information System and Computer Engineering (CISCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISCE50729.2020.00097\",\"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 Communications, Information System and Computer Engineering (CISCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISCE50729.2020.00097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了实现实时、准确的数据挖掘,本文提出了一种基于RBF神经网络优化算法的数据关联规则挖掘方法。在考虑约束关联规则的基础上,对数据频繁项集进行约简,得到满足规则的候选数据集,完成对用户需要的数据频繁项集的更新。将候选数据集输入RBF神经网络进行训练,结合粗糙集理论对网络输出进行优化,构造用户需求数据表和四元组,描述用户需求属性,采用上界剪枝法获得用户需求数据。通过上界剪枝法获取用户需求数据,实现实时挖掘。仿真结果表明,与其他数据挖掘算法相比,本文提出的数据挖掘算法的性能受冗余数据比例和数据大小的约束较小,数据挖掘的精度更高,并且具有更好的稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Data Association Rules Mining Method Based on RBF Neural Network Optimization Algorithm
In order to achieve real-time and accurate data mining, this paper proposes a data association rules mining method based on RBF neural network optimization algorithm. On the basis of considering the constraint association rules, the data frequent itemsets are reduced to get the corresponding candidate data sets that meet the rules, and the update of the data frequent itemsets for user needs is completed. The candidate data set is input to RBF neural network for training, the network output is optimized by combining with rough set theory, the user demand data table and quadruple are constructed, the user demand attributes are described, and the user demand data is obtained by using upper bound pruning method. Through the upper bound pruning method, the user demand data is obtained and real-time mining is realized. Compared with other data mining algorithms, the simulation results show that the performance of the data mining algorithm proposed in this paper is less constrained by the proportion of redundant data and the size of data, the accuracy of data mining is higher, and it has better stability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信