【摘要】 关联规则挖掘是数据挖掘领域中的重要研究方向,该文在分析关联规则挖掘Apriori算法原理和性能的基础上,指出了该算法存在着两点不足:扫描事务数据库的次数和连接成高维候选项目集时的比较次数太多。并提出了一种效率更高的S_Apriori算法,该算法通过采用新的数据结构和原理,克服了传统Apriori算法的缺点,从而大大提高了运算效率。更多还原

【Abstract】 The mining association rules is an important aspect in the data mining research field.Based on analyzing theory and performance of Apriori algorithm for mining association rules,this paper expounded the two defects of Apriori algorithm : the times of scaning database and compareing condition for joining the higher degree frequent itemsets are overmany,and proposed high efficient S_Aprior algorithm.The improved algorithm overcomes the shortcoming of the traditional Apriori algorithm and can greatly improves operational efficiency through adoption of new database structure and principle.更多还原