摘要
在Apriori算法算法基础上提出改进的方法，通过减少产生候选集的组合和减少数据库的扫描来提高挖掘的速度和减少数据库的I／O操作时问的开销。
This article analyzes and studies the improved algorithm Apriori based on the algorithm of mining associa-tion rules Apriori. The main idea is to reduce the number of candidate items and to reduce the times of Database scan-ning. The solution is available. It upgrades the speed of data mining and decreases computer's I/O operation. It's proved to be more efficient than the traditional method.
出处
《绍兴文理学院学报（自然科学版）》
2003年第9期36-40,共5页
Journal of Shaoxing College of Arts and Sciences
