关系数据库中关联规则挖掘的一种高效算法

An Effective Algorithm of Association Rules Mining in Relational Database

近年来,关系数据库被越来越多的行业采用,大量的生产、管理、科研等信息被收集存储,因此在关系数据库中进行有效的关联规则挖掘的需求日益增强。文中根据事务数据库中布尔型关联规则挖掘的相关理论和方法,在分析了关系数据库中关联规则挖掘具有的特殊性的基础上,从利用结构化查询语言(SQL)对关系数据库简便而高效的操作出发,提出了一种在关系数据库中挖掘多值型、多维型关联规则的简易算法。实验证明该算法具有较高的执行效率和一定的实用性。

In the recent years, relational database is adopted by increasing industries. A lot of informations of production, management and scientific research are collected and stored, so the requirement about mining association rules effectively in relational database is reinforcing increasingly. According to the relative theory and method of Boolean association rules mining in transaction database, analyzes the particularity of association rules mining in relational database. Based on a convenient and effective operating of relational database by SQL language,the paper represents an effective algorithm of mining multi-value and multi-dimension association rules in relational database. Experiments prove the algorithm is high effective and practical.