期刊
IEEE ACCESS
卷 6, 期 -, 页码 68013-68026出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2018.2880275
关键词
Apriori; frequent itemset mining; heuristic; parallel computing; support computing
资金
- National Natural Science Foundation of China (NSFC) [61503092]
- Shenzhen Technical Project [JCYJ20170307151733005, KQJSCX20170726103424709]
- Algerian Ministry of Higher Education under DGRSDT
- Norwegian University of Science and Technology (NTNU), through European Research Consortium for Informatics and Mathematics (ERCIM)
This paper considers frequent itemsets mining in transactional databases. It introduces a new accurate single scan approach for frequent itemset mining (SSFIM), a heuristic as an alternative approach (EA-SSFIM), as well as a parallel implementation on Hadoop clusters (MR-SSFIM). EA-SSFIM and MR-SSFIM target sparse and big databases, respectively. The proposed approach (in all its variants) requires only one scan to extract the candidate itemsets, and it has the advantage to generate a fixed number of candidate itemsets independently from the value of the minimum support. This accelerates the scan process compared with existing approaches while dealing with sparse and big databases. Numerical results show that SSFIM outperforms the state-of-the-art FIM approaches while dealing with medium and large databases. Moreover, EA-SSFIM provides similar performance as SSFIM while considerably reducing the runtime for large databases. The results also reveal the superiority of MR-SSFIM compared with the existing HPC-based solutions for FIM using sparse and big databases.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据