Home > Papers

 
 
A Fast ORD Algorithm to Obtain Decision Rules
Li Chuang * #,Yang Sheng,Li Renfa
School of Computer & Communication,Hunan University,Changsha
*Correspondence author
#Submitted by
Subject:
Funding: national science foundation,important program of education ministry（No.60603053,106158）
Opened online:30 September 2007
Accepted by: none
Citation: Li Chuang,Yang Sheng,Li Renfa.A Fast ORD Algorithm to Obtain Decision Rules[OL]. [30 September 2007] http://en.paper.edu.cn/en_releasepaper/content/15469
 
 
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
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 587
Bookmarked 0
Recommend 5
Comments Array
Submit your papers