Improved algorithm for discretization of decision table

摘要：

　　Discretization of decision table is the important step for pretreatment of data mining and machine learning,which related to the effect of learning.It has great contribution to speeding up the followed learning algorithms,cutting down the real demand of algorithms on running space and time.In this paper,the basic characteristics and framework of discretization approaches about greedy and improved algorithm are analyzed at first,then a new algorithm is put forward to select the useful cuts.The example is given to show that the useful cuts is consistent with the result of technicist.The algorithm offered the important theoretics basis for followed attribute reduction.

关键词： discretization greedy algorithm clustering

作者: Li-Fang Chen Ma Ying

作者单位: College of science Hebei Polytechnic University, Tangshan, China

会议类型: 国际会议

会议名称: 2012 2nd international Conference on Materials Science and Information Technology(2012第二届材料科学与信息技术国际会议)(MSIT2012)

会议地点: 西安

会议语种:英文

页码: 1649-1653

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