摘要
针对Apriori算法效率的不足,提出了适合关系数据库中的关联规则挖掘的IMM_Apriori算法。通过对基于矩阵的算法进行改进,引入删除压缩技术提高了算法性能,有效地解决了Apriori算法在发现频繁2-项集时的效率瓶颈问题,并从理论上证明了算法的正确性和可行性。通过在公安情报信息系统中的实际应用,验证了算法良好的适应性和可扩展性。
Aimed to the choke point on the efficiency about Apriori algorithm,an Improved Mutiply_Matrix Apriori algorithm (IMM_Apriori) using for connection rule excavation in the relational database is proposed.Through introducing compress and expurgate method,and adopting reformative matrix-based algorithm,the IMM_Apriori algorithm capability is improved and the choke point on the efficiency is overcome.It has confirmed the algorithm good compatibility and expansibility by using in the system of public security information management.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第5期209-211,238,共4页
Computer Engineering and Applications