摘要
目前,已经提出了许多挖掘关联规则的算法,其中最著名的是Apriori算法及其变型。这些传统的算法大多存在项集生成瓶颈和难以确定合适的支持度阈值的问题,并且没有考虑数据库的被分析项的各自不同的重要性。深入分析研究关联规则Apriori算法,并给出几种改进的算法。
At present, lots of algorithms are proposed, such as Apriori and its transformative.These traditional algorithms often suffer from the bottleneck of items generation and confirm difficultly a suitable minimum support. Gives many updating algorithms based on the algorithm Apriori of association roles.
出处
《现代计算机》
2009年第5期47-50,共4页
Modern Computer