A Fast ORD Algorithm to Obtain Decision Rules
首发时间:2007-09-30
Abstract:ORD algorithm is an efficient associate rule mining algorithm. It can prune redundant itemsets and redundant rules fast. In this paper, a novel decision rules mining algorithm is presented combining rough set theory with ORD algorithm——ORDMDR. AIEBBE, an attribute reduction algorithm is used to reduct attributes in incomplete information system firstly. Then, ORD is used to obtain decision rules. This algorithm is compared with other rough set theory based algorithms for mining decision rules. Experiment results show it has better performance.
keywords: decision rule, attribute reduction, rough set
点击查看论文中文信息
A Fast ORD Algorithm to Obtain Decision Rules
摘要:ORD algorithm is an efficient associate rule mining algorithm. It can prune redundant itemsets and redundant rules fast. In this paper, a novel decision rules mining algorithm is presented combining rough set theory with ORD algorithm——ORDMDR. AIEBBE, an attribute reduction algorithm is used to reduct attributes in incomplete information system firstly. Then, ORD is used to obtain decision rules. This algorithm is compared with other rough set theory based algorithms for mining decision rules. Experiment results show it has better performance.
论文图表:
引用
No.1546915093311911****
同行评议
共计0人参与
勘误表
A Fast ORD Algorithm to Obtain Decision Rules
评论
全部评论0/1000