【摘要】 本文采用一种基于布尔矩阵的频繁集挖掘算法。该算法直接通过支持矩阵行向量的按位与运算来找出频繁集,而不需要Apriori算法的连接和剪枝,通过不断压缩支持矩阵,不仅节约了存储空间,还提高了算法的效率。更多还原

【Abstract】 The discovery of association rules in data mining is an important issue,the core of which is the frequent pattern mining,Apriori algorithm is classical for the association rule mining,but it should repeatedly scan thed database and can produce plenty of candidates.The paper proposed a new algorithm based on Boolean matrix,Through direct support of the matrix by the vector-line operations and to identify frequent sets,the new algorithm simplifies the join step and the prune step in Apriori algorithm.Also it reduces the support matrix unceasingly to reduce the higher mode frequent collection excavation time and save the storage space.更多还原