An Improved DM Algorithm Based on Rough Set Theory

摘要：

The basic idea of an improved algorithm is outlined in this paper firstly, includes main steps and the advantages and disadvantages of CART algorithm; and then the definitions of attribute importance and the system comprehensive information entropy and the algorithm of maintaining maximum system comprehensive information entropy are presented. Compares to some disadvantages of CART algorithm such as low computation efficiency of extraction rules and long rule length, the improved algorithm has effect in the experimental result.

关键词： Attribute Importance Value Rule Extraction Comprehensive Information Entropy

作者: Yang Zu-Qiao Xiao Xiao-Hong Gao Han-ping

作者单位: School of Computer Science and Technology, HuangGang Normal University 146 Xin Gang Er Road, HuangGang 438000, China

会议类型: 国际会议

会议名称: 第三届IEEE无线通讯、网络技术暨移动计算国际会议

会议地点: 上海

会议语种:英文

在线出版日期: 2007-09-21（万方平台首次上网日期，不代表论文的发表时间）