摘要
针对基于矩阵的apriori算法在删减矩阵前对频繁k-1-项集存在多余扫描的问题,根据apriori算法项集的有序性和删减矩阵的相关性质,提出了一种改进的查找方法,减少了扫描量,从而达到了降低算法时间复杂度的目的。
Aiming at the problems of unnecessary scanning of frequent k-1 itemsets before reduce matrix in apriori algorithm based on matrix,Propose a improved search method to reduce the scanning according to the orderliness of itemsets of apriori algorithm and the related nature of reduce matrix ,and so as to reduces the temporal complexity of algorithm.
出处
《电子设计工程》
2015年第13期52-54,61,共4页
Electronic Design Engineering
