| 基于十字链表的Apriori算法的研究与改进 |
| |
| 引用本文： | 刘玉文.基于十字链表的Apriori算法的研究与改进[J].计算机应用与软件,2012,29(5):267-269. |
| |
| 作者姓名： | 刘玉文 |
| |
| 作者单位： | 蚌埠医学院计算机教研室 安徽 蚌埠 233030 |
| |
| 摘 要： | 在关联规则挖掘中,主要的问题是如何高效地产生频繁项集。对近年来一些基于十字链表的Apriori算法进行研究和分析,发现它们的候选频繁项集生成方法有很大的改进空间。提出一个基于十字链表的改进算法,优化候选频繁项集的生成方法,减少对事务数据库的扫描,大大提高了挖掘效率。
|
| 关 键 词： | 十字链表 关联规则 Apriori算法 频繁项集 候选频繁项集 |
ORTHOGONAL LIST BASED APRIORI ALGORITHM RESEARCH AND IMPROVEMENT |
| |
| Liu Yuwen.ORTHOGONAL LIST BASED APRIORI ALGORITHM RESEARCH AND IMPROVEMENT[J].Computer Applications and Software,2012,29(5):267-269. |
| |
| Authors: | Liu Yuwen |
| |
| Affiliation: | Liu Yuwen(Computer Researching and Teaching Department,Bengbu Medical College,Bengbu 233030,Anhui,China) |
| |
| Abstract: | In association rule mining,a principle problem is how to efficiently generate frequent itemsets.A number of orthogonal list based Apriori algorithms are studied and analyzed.It is revealed that there is much room for improvement with their candidate frequent itemset generation methods.Therefore the paper presents an improved algorithm based on orthogonal list that optimizes the candidate frequent itemsets generation method,reduces scans over the transaction database,thus greatly improves its mining efficiency. |
| |
| Keywords: | Orthogonal list Association rule Apriori algorithm Frequent itemsets Candidate frequent itemset |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
