{"title":"Hybrid search based association rule mining","authors":"A. M. Ghanem, H. Sallam","doi":"10.1109/PACRIM.2011.6032963","DOIUrl":null,"url":null,"abstract":"Association rule mining algorithms provide different search strategies to discover the frequent itemsets; however the problem of large search space is still hard to handle. The present paper suggests a novel hybrid search technique based on reducing the search space, I/O, and CPU times. This can improve the performance up to several orders of magnitude compared to APRIORI algorithm.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2011.6032963","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Association rule mining algorithms provide different search strategies to discover the frequent itemsets; however the problem of large search space is still hard to handle. The present paper suggests a novel hybrid search technique based on reducing the search space, I/O, and CPU times. This can improve the performance up to several orders of magnitude compared to APRIORI algorithm.