摘要
给出了一种对Apriori算法改进的算法。改进的算法只需扫描一次数据库D,同时简化了Apriori算法,减少了存储设备I/O时间,提高了算法的效率。
This paper has introduced an enhanced algorithm for Apriori algorithm. The enhanced algorithm can be achieved through scanning only one time database D, and at the same time apriori algorithm is simplified, the I/O time of memory is shortened, efficiency of the algorithm is improved.
出处
《佛山科学技术学院学报(自然科学版)》
CAS
2007年第2期54-57,共4页
Journal of Foshan University(Natural Science Edition)
关键词
数据挖掘
关联规则
频繁项集
data mining
association rule
frequent itemsets