A Fast Cutpoints Sieve Method for Interval-valued Decision Tree

摘要：

In this paper,the concept of the frequently coveredpoints(FCP)and the infrequently covered points (ICP)is presented By means of the cutpoints sieve methodwe can rapidly pick out the corresponding cutpoints ofICP,namely preferred cutpoints,from all pendingcutpoints of interval attributes.And then,onlypreferred cutpoints are used for computinginformation entropy of partition(IEP).Finally,theinterval-valued decision tree can be built by IEP.Theexperiment indicates that,in general,this methodcould,to a great extent,reduce the computationalcomplexity of creation of decision tree,thereby,improving the efficiency of classification.

关键词： interval-valued attributes cutpoints decision tree sieve method

作者: Ming-zhi Chen Lun Yu Shui-li Chen

作者单位: College of Physics and Information Engineering,Fuzhou University,Fuzhou,350002,China School of Science,Jimei University,Xiamen,Fujian 361021,China

会议类型: 国际会议

会议名称: 2008 3rd International Conference on Intelligent System and Knowledge Engineering(第三届智能系统与知识工程国际会议)(ISKE 2008)

会议地点: 厦门

会议语种:英文

页码: 615-618

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