哈尔滨理工大学计算机科学与技术学院
Published:2009
移动端阅览
SONG Guang-ling, HAO Zhong-xiao. An Improved Algorithm Based on CART Decision[J]. 2009, 14(2): 17-20.
DOI:
SONG Guang-ling, HAO Zhong-xiao. An Improved Algorithm Based on CART Decision[J]. 2009, 14(2): 17-20. DOI:
针对分析CART算法的要求被选择的属性是连续且有序的
并且只能产生两个子节点的问题
依据CART算法理论
采用A-CART算法
弥补了CART方法的不足.是一种选用离散无序的属性作为决策树的分裂节点
分裂后可以产生多个子节点的方法
并为此方法设计了分裂函数
通过一个实例给出了具体的使用方法.
In view of basis on analyzing insufficient of the classifacation and regression trees(CART) algorithm
which requests the choosen attribute is continual and having order
and onlycan produce two children nodes
based on CART algorithm theory
this paper uses A-CART the algorithm
makes up the CART method insufficiency
namely the method which selects the discrete and disorder attribute to accomplish split point of decision tree
after splitting it may have many split node.It has designed a split function for the a...
0
Views
3259
下载量
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution