摘要
本研究在对Apriori算法分析的基础上,提出了改进的Apriori算法。改进后的算法采用矩阵表示数据库,减少了扫描事物数据库的次数;利用向量运算来实现频繁项集的计数,同时及时地去掉不必要的数据,减少了数据运算,从而提高了算法的运行效率。
Based on analysis of the classical Apriori algorithm in mining association rule, this paper presents an improved Apriori algorithm to increase the efficiency of generating association rules. The improved algorithm adopts matrix to express database, which can reduce the times of database scanning . The improved algorithm use vectors operation to count frequent item sets and get rid of unwanted data simultaneously. Redundant data are deleted in time to improve the Apriori algorithm.
出处
《青岛科技大学学报（自然科学版）》
CAS
2008年第5期448-451,共4页
Journal of Qingdao University of Science and Technology:Natural Science Edition
