Cutting-point selection

ibadami / randomforest-matlab

Automatically exported from code.google.com/p/randomforest-matlab

0 stars 0 forks source link

Cutting-point selection #29

Open GoogleCodeExporter opened 9 years ago

GoogleCodeExporter commented 9 years ago

Hello,
Thanks for submitting this implementation which is great.

I'm wondering in this implementation how do you determine the best 
cutting-point at each node given a randomly selected attribute?

Does it search through all possible cutting points and use the one with best 
score in certain metric?

Thanks

Original issue reported on code.google.com by chuan.ch...@gmail.com on 30 Mar 2012 at 11:34

GoogleCodeExporter commented 9 years ago

thanks,

the splitting criteria is the same as CART works either via gini index or the 
least squares deviation http://www.stat.wisc.edu/~loh/treeprogs/guide/eqr.pdf 
http://civil.colorado.edu/~balajir/CVEN6833/lectures/cluster_lecture-2.pdf (pg3)

this implementation is derived from R's implementation of randomForest which is 
in turn derived from the random forests's author's code which uses CART

Original comment by abhirana on 31 Mar 2012 at 8:03