{"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}
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.