摘要
采用向量矩阵进行关联规则挖掘,较之一般的挖掘算法在发现频繁项目集方面有更高的效率。本文提出的算法只需要对数据库扫描一遍,并且存放辅助信息所需要的空间也少,因此具有很好的实用性。
Mining association rules is an important problem in data mining. Generating large itemsets is critical.In this paper, we presents a novel algorithm based on vector matrix for finding frequent itemsets ,and compare it with two traditional algorithms. It only needs to scan the database once and needs less memory space for assistant information. Experimental results indicate that the new algorithm is practical.
出处
《计算机工程与科学》
CSCD
2004年第11期69-70,74,共3页
Computer Engineering & Science