摘要
为了解决数据挖掘中关联规则Apriori算法存在的缺陷,提出了一种全新的基于对候选项集处理的改进算法。该算法主要采用一次扫描数据库和对候选项集进行计数处理的方法,实现了减少执行时间以及计算量的目的。实际应用表明,改进后的Apriori算法具有操作简便、测试准确的特点,达到了提高数据挖掘效率和准确性的要求。
In order to solve the problem of data mining association rules in defects of Apriori algorithm, this paper puts forward a new candidate sets based on improved algorithm of. The algorithm mainly uses a scan of the database and the candidate set for counting method, the reduction of execution time and the amount of computation. The practical application show that, the improved Apriori algorithm has the advantages of simple operation, accurate test characteristics, to improve the efficiency of data "mining and accuracy requirements.
出处
《电子设计工程》
2013年第15期37-40,共4页
Electronic Design Engineering