A Fast Parallel Association Rule Mining Algorithm Based on The Probability of Frequent Itemsets

Marghny H. Mohamed; Hosam E. Refaat

首页> 外文期刊>International journal of computer science and network security >A Fast Parallel Association Rule Mining Algorithm Based on The Probability of Frequent Itemsets

【24h】

A Fast Parallel Association Rule Mining Algorithm Based on The Probability of Frequent Itemsets

机译：基于频繁项集概率的并行关联规则快速挖掘算法

获取原文

获取外文期刊封面封底 >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Frequent itemset finding is the most costly processing step in analyzing large transactional databases. At each stage in discovering frequent itemset a huge number of candidate itemsets are produced. Then, if we predict which candidate itemset will be fre

机译：频繁查找项目集是分析大型事务数据库中最昂贵的处理步骤。在发现频繁项目集的每个阶段，都会生成大量候选项目集。然后，如果我们预测哪个候选项目集将是

著录项

来源
《International journal of computer science and network security》 |2011年第5期|共11页
作者
Marghny H. Mohamed; Hosam E. Refaat;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种
中图分类自动化技术、计算机技术;
关键词

相似文献

外文文献
中文文献
专利

1. A Fast Parallel Association Rule Mining Algorithm Based on The Probability of Frequent Itemsets [J] . Marghny H. Mohamed, Hosam E. Refaat International journal of computer science and network security . 2011,第5期

机译：基于频繁项集概率的并行关联规则快速挖掘算法
2. Parallel Semi-supervised enhanced fuzzy Co-Clustering (PSEFC) and Rapid Association Rule Mining (RARM) based frequent route mining algorithm for travel sequence recommendation on big socialmedia [J] . N. Suresh Kumar, M. Thangamani CONCURRENCY PRACTICE & EXPERIENCE . 2019,第14期

机译：大型社交媒体上基于并行半监督增强型模糊联合聚类（PSEFC）和快速关联规则挖掘（RARM）的频繁路线挖掘算法推荐行程
3. A time- and memory-efficient frequent itemset discovering algorithm for association rule mining [J] . Renata Ivancsy, Istvan Vajk International Journal of Computer Applications in Technology . 2006,第4期

机译：一种节省时间和内存的频繁项集发现算法，用于关联规则挖掘
4. Apriori, Association Rules, Data Mining,Frequent Itemsets Mining (FIM), Parallel Computing [C] . Yoshikawa M., Terai H. Software Engineering Research, Management and Applications, 2006. Fourth International Conference on . 2006

机译：Apriori，关联规则，数据挖掘，频繁项集挖掘（FIM），并行计算
5. Fast algorithms for mining association rules and sequential patterns. [D] . Srikant, Ramakrishnan. 1996

机译：用于挖掘关联规则和顺序模式的快速算法。
6. Negative and Positive Association Rules Mining from Text Using Frequent and Infrequent Itemsets [O] . Sajid Mahmood, Muhammad Shahbaz, Aziz Guergachi -1

机译：使用频繁和不频繁项集从文本中挖掘负向和正向关联规则
7. A fast parallel algorithm for frequent itemsets mining [O] . Souliou, D, Pagourtzis, A, Tsanakas, P 2007

机译：一种快速并行的频繁项集挖掘算法

A Fast Parallel Association Rule Mining Algorithm Based on The Probability of Frequent Itemsets

摘要

著录项

相似文献

相关主题

期刊订阅