摘要
在Apriori算法的基础上,提出一种基于十字链表的关联规则挖掘算法。该算法能够快速得到每个候选项的支持度,从而有效的发现频繁项集。通过与经典算法分析对比表明,该算法具有明显的优势。
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.
出处
《江西科学》
2009年第6期895-898,共4页
Jiangxi Science
