Research on dynamic algorithm of decision tree
Qingyun Chi · Journal of Shaoyang University · 2007
In this paper,we improve traditional algorithm such as SPRINT,RAINFOREST and etc,and let them adapt to exercitation cluster grown continuously.Algorithm after improvement shows that:Once new sample appear it immediately is available and can generate one relevant decision tree,and this tree is also continuously optimized.