| 一种基于十字链表的频繁项集挖掘算法 |
| |
| 引用本文： | 李磊,段隆振,刘飞荣,杨彦铃.一种基于十字链表的频繁项集挖掘算法[J].江西科学,2009,27(6):895-898. |
| |
| 作者姓名： | 李磊 段隆振 刘飞荣 杨彦铃 |
| |
| 作者单位： | 南昌大学信息工程学院,江西,南昌,330029 |
| |
| 摘 要： | 在Apriori算法的基础上，提出一种基于十字链表的关联规则挖掘算法。该算法能够快速得到每个候选项的支持度，从而有效的发现频繁项集。通过与经典算法分析对比表明，该算法具有明显的优势。
|
| 关 键 词： | Apriori算法 十字链表 关联规则 频繁项 |
Algorithm for Frequent Items Mining Based on Across Linker |
| |
| LI Lei,DUAN Long-zhen,LIU Fei-rong,YANG Yan-ling.Algorithm for Frequent Items Mining Based on Across Linker[J].Jiangxi Science,2009,27(6):895-898. |
| |
| Authors: | LI Lei DUAN Long-zhen LIU Fei-rong YANG Yan-ling |
| |
| Institution: | ( School of Information Engineering, Nanchang University, Jiangxi Nanchang 330029 PRC ) |
| |
| Abstract: | The algorithm for frequent items mining based on across linker is proposed based on the Apriori algorithm. The algorithm can quickly get the support of each candidate, the order to the discovery of frequent items efficiently. Through comparising with the classical algorithm show that the improved algorithm has obvious advantages. |
| |
| Keywords: | Apriori algorithm Across linker Association rule Frequent item |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
