A Two-step Discretization Algorithm Based on Rough Set

摘要：

A two-step discretization algorithm by dynamic clustering based on Rough set is proposed. The algorithm first discretization for decision table using dynamic clustering algorithm, then discrete again using cut importance discretization algorithms, and obtain the final cut sets, because the dynamic clustering algorithm processing speed is quickly and it impel a lot of breakpoint be screened, thus the operation efficiency of algorithm is increase notable. Finally, simulation results show that the proposed algorithm is correct and high efficiency.

关键词： rough set Partition, Discretization

作者: XU Chenggang XU Yulong XIAO Dawei

作者单位: Institute of Information and Technology, Henan University of Traditional Chinese Medicine ZhengZhou 450003, China

会议类型: 国际会议

会议名称: 2012 International Conference on Computer Science and Electronic Engineering(2012 IEEE计算机科学与电子工程国际会议 ICCSEE 2012)

会议地点: 杭州

会议语种:英文

页码: 178-182

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