欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
关联规则挖掘是数据挖掘的重要领域之一,利用粗糙集理论来挖掘关联规则的方法已经得到广泛关注。针对不完备信息系统,提出了基于粗糙集理论的快速ORD关联规则挖掘算法。该算法首先采用基于粗糙集理论的属性约简算法进行属性约简,然后采用快速、高效的冗余项集和冗余规则修剪算法——ORD算法获取关联规则。将该算法与其它同类流行的算法在4个UCI数据集上进行实验比较,结果表明该算法性能良好。
英文摘要：
Association rule mining algorithm is one of the important tasks in data mining. Using rough set theory to discovery association rule is being attended extensively. It is a promising approach. For incomplete information system, a rough set theory based fast ORD algorithm for mining association rules is presented. The attribute reduction algorithm is used to reduce attributes firstly. Then the fast and efficient algorithm for pruning redundant itemsets and redundant rules, ORD algorithm is applied to obtaining association rules. This algorithm is compared with other congeneric and popular algorithms on UCI four data sets respectively. Experimental results show it has good performance.
同期刊论文项目
同项目期刊论文
期刊信息
位置：