A Two-step Integration Algorithm for Discretization Based on Rough Set Theory

摘要：

Discretization plays an important role in rough set theory. So far, many efficient algorithms have been proposed, but few of them can process data sets quickly with high recognition rate. In this paper, the distribution of importance of candidate breakpoints on single attribute in decision table is analyzed. Firstly, the candidate cuts will be dynamic clustered combining with Information Entropy value of candidate breakpoints. Secondly, the clustered cut points will be selected using the importance algorithm of candidate cut points. Thedynamic clustering can decrease the number of condition points effectively which is useful to select breakpoints. Experiment results show that the proposed algorithm can process data sets quickly with high recognition rate.

关键词： rough set disc entropy information breakpoints importance integration

作者: LIU Jingi LUO Wei-ming LIU Jing-bo

作者单位: Network Information Center,Yao Zhen4 Electronic Engineering College Chongqing Three Gorges Universit College of Mathematics&Computer Science Chongqing Three Gorges University WanZhou Chongqing, China

会议类型: 国际会议

会议名称: 2011 6th Joint International Information Technology and Artificial Intelligence Conference(2011年第六届IEEE联合国际信息技术与人工智能会议 IEEE ITAIC 2011)

会议地点: 重庆

会议语种:英文

页码: 418-420

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