{"title":"利用混合先验-遗传算法生成关联规则,对网络流量进行优化","authors":"S. Chadokar, Divakar Singh, Anju Singh","doi":"10.1109/WOCN.2013.6616233","DOIUrl":null,"url":null,"abstract":"Association rule mining is a technique of generating frequent item sets so that the analysis on the basis of these sets can be used for different application areas such as analysis of network traffic. Although the frequent sets generated using apriori algorithm provides less computational time and provides less frequent sets, but the technique that we are implemented here provides less computational time as compared as well generated less sets and provides less rules for the network traffics. These frequent sets are used for the analysis of traffic in the network so that the analysis of different spams or any unwanted issues can be detected easily.","PeriodicalId":388309,"journal":{"name":"2013 Tenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Optimizing network traffic by generating association rules using hybrid apriori-genetic algorithm\",\"authors\":\"S. Chadokar, Divakar Singh, Anju Singh\",\"doi\":\"10.1109/WOCN.2013.6616233\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Association rule mining is a technique of generating frequent item sets so that the analysis on the basis of these sets can be used for different application areas such as analysis of network traffic. Although the frequent sets generated using apriori algorithm provides less computational time and provides less frequent sets, but the technique that we are implemented here provides less computational time as compared as well generated less sets and provides less rules for the network traffics. These frequent sets are used for the analysis of traffic in the network so that the analysis of different spams or any unwanted issues can be detected easily.\",\"PeriodicalId\":388309,\"journal\":{\"name\":\"2013 Tenth International Conference on Wireless and Optical Communications Networks (WOCN)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Tenth International Conference on Wireless and Optical Communications Networks (WOCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOCN.2013.6616233\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Tenth International Conference on Wireless and Optical Communications Networks (WOCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCN.2013.6616233","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimizing network traffic by generating association rules using hybrid apriori-genetic algorithm
Association rule mining is a technique of generating frequent item sets so that the analysis on the basis of these sets can be used for different application areas such as analysis of network traffic. Although the frequent sets generated using apriori algorithm provides less computational time and provides less frequent sets, but the technique that we are implemented here provides less computational time as compared as well generated less sets and provides less rules for the network traffics. These frequent sets are used for the analysis of traffic in the network so that the analysis of different spams or any unwanted issues can be detected easily.