决策树算法 sklearn使用
一棵树,从根结点开始划分,向下不断分裂,分而治之
叶子结点得出决策结果
from sklearn import tree.DecisionTreeClassifier
(criterion=’gini’, splitter=’best’, max_depth=None,
min_samples_split=2, min_samples_leaf=1,
min_weight_fraction_leaf=0.0,
max_features=None, random_state=None, max_leaf_nodes=None,
min_impurity_decrease=0.0,
min_impurity_split=None, class_weight=None,
presort=False)