基于混合搜索的关联规则挖掘

Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI:10.1109/PACRIM.2011.6032963

A. M. Ghanem, H. Sallam

{"title":"基于混合搜索的关联规则挖掘","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":"{\"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}","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

摘要

关联规则挖掘算法提供不同的搜索策略来发现频繁项集;然而，大搜索空间的问题仍然难以解决。本文提出了一种基于减少搜索空间、I/O和CPU时间的新型混合搜索技术。与APRIORI算法相比，这可以将性能提高几个数量级。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Hybrid search based association rule mining

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing

自引率

0.00%

发文量