-iP/SrSSKrSSKrSSKJrJr SSKJr SSKJrJ r SSK r SSK J r SSKJr SS KJrJrJrJrJrJrJr SS KJrJrJr SS KJrJrJrJ r SS K!J"r" SS K#J$r$J%r%J&r&J'r'J(r(J)r) SSK*J+r+J,r,J-r- SSK+J.r. SSK,J/r/ SSK-J0r0J1r1J2r2J3r3J4r4 SSK5J6r6 /SQr7\-Rpr8\-Rrr9\+Rt\+Rv\+RvS.r<\+Rz\+R|\+R~\+RS.rA\,R\,RS.rD\,R\,RS.rG"SS\\\S9rH"SS\\H5rI"SS\\H5rJ"SS \I5rK"S!S"\J5rLg)#z This module gathers tree-based methods, including decision, regression and randomized trees. Single and multi-output problems are both handled. N)ABCMetaabstractmethod)ceil)IntegralReal)issparse)metadata_routing) BaseEstimatorClassifierMixinMultiOutputMixinRegressorMixin _fit_contextclone is_classifier)Bunchcheck_random_statecompute_sample_weight)HiddenInterval RealNotInt StrOptions)check_classification_targets)_assert_all_finite_element_wise_check_n_features_check_sample_weightassert_all_finitecheck_is_fitted validate_data) _criterion _splitter_tree) Criterion)Splitter)BestFirstTreeBuilderDepthFirstTreeBuilderTree_build_pruned_tree_ccpccp_pruning_path)_any_isnan_axis0)DecisionTreeClassifierDecisionTreeRegressorExtraTreeClassifierExtraTreeRegressor)ginilog_lossentropy) squared_error friedman_mseabsolute_errorpoissonbestrandomc^\rSrSr%SrS\R 0r\"SS15/\ "\ SSSS 9S/\ "\ S SSS 9\ "\ S S S S 9/\ "\ SSSS 9\ "\ S S SS 9/\ "\ S SSS 9/\ "\ SSSS 9\ "\ S S S S 9\"SS15S/S/\ "\ S SSS 9S/\ "\ S SSS 9/\ "\ S SSS 9/SS/S. r \\S'\SS SS.Sj5rSrSrSrS'SjrS(SjrSrS)SjrS)S jrS)S!jrS"rS'S#jr\S$5rU4S%jrS&r U=r!$)*BaseDecisionTree[znBase class for decision trees. Warning: This class should not be used directly. Use derived classes instead. check_inputr8r9r Nleft)closedr ?rightneitherg?bothsqrtlog2 random_statez array-like) splitter max_depthmin_samples_splitmin_samples_leafmin_weight_fraction_leaf max_featuresrGmax_leaf_nodesmin_impurity_decrease ccp_alpha monotonic_cst_parameter_constraints) class_weightrPrQc XlX lX0lX@lXPlX`lXplXlXlXl Xl Xl Xl gN) criterionrHrIrJrKrLrMrNrGrOrSrPrQ)selfrVrHrIrJrKrLrMrNrGrOrSrPrQs H/var/www/html/venv/lib/python3.13/site-packages/sklearn/tree/_classes.py__init__BaseDecisionTree.__init__sN$# "!2 0(@%(,(%:"("*cD[U5 URR$)zReturn the depth of the decision tree. The depth of a tree is the maximum distance between the root and any leaf. Returns ------- self.tree_.max_depth : int The maximum depth of the tree. )rtree_rIrWs rX get_depthBaseDecisionTree.get_depths zz###r[cD[U5 URR$)zsReturn the number of leaves of the decision tree. Returns ------- self.tree_.n_leaves : int Number of leaves. )rr]n_leavesr^s rX get_n_leavesBaseDecisionTree.get_n_leavess zz"""r[c[U5(+=(a9 UR5RR=(a URSL$rU)r__sklearn_tags__ input_tags allow_nanrQ)rWXs rX_support_missing_values(BaseDecisionTree._support_missing_valuess@ O +%%'22<< +""d* r[cU=(d URRn[USS9nURU5(d [ U40UD6 g[ R "SS9 [ R"U5nSSS5 [ R"W5(d[U4[ SS.UD6 [ R"U5(dg[U5nU$!,(df  Ne=f)aReturn boolean mask denoting if there are missing values for each feature. This method also ensures that X is finite. Parameter --------- X : array-like of shape (n_samples, n_features), dtype=DOUBLE Input data. estimator_name : str or None, default=None Name to use when raising an error. Defaults to the class name. Returns ------- missing_values_in_feature_mask : ndarray of shape (n_features,), or None Missing value mask. If missing values are not supported or there are no missing values, return None. ri)estimator_name input_nameNignore)overT)xprh) __class____name__dictrjrnperrstatesumisfiniterisnanr+)rWrirm common_kwargs overall_summissing_values_in_feature_masks rX'_compute_missing_values_in_feature_mask8BaseDecisionTree._compute_missing_values_in_feature_masks&(B4>>+B+BNsK ++A.. a 1= 1 [[h '&&)K({{;'' +A V" V Vxx $$)9!)<&--( 's !C C%c L[UR5nU(Ga[[SSS9n[SSS9n[ XX'U4S9upUR U5n[ U5(akUR5 URR[R:wd(URR[R:wa [S5eURS:XaN[R"US:5(a [S 5e[R "U5S::a [S 5eUR"uol['U5n [R("U5nSn UR*S :Xa[R,"US 5nUR"S UlU (GaP[1U5 [R2"U5n/Ul/UlUR8b[R2"U5n [R:"UR"[<S 9n [?UR.5Hkn[R@"USS2U4SS9uoSS2U4'UR4RCU5 UR6RCUR"S5 Mm U nUR8b[EUR8W 5n [RF"UR6[RHS 9UlUSS5[L:wdURNRP(d[RR"U[LS 9nURTc.[RV"[RX5RZO URTn[]UR^[`Rb5(a UR^nO[eUR^U -5n[]URf[`Rb5(a URfnO$[eURfU -5n[[SU5n[[USU-5n[]URh[j5(aURhS:Xa4[[S [=[Rl"UR$555nOURhS:Xa3[[S [=[Rn"UR$555nOURhc UR$nOu[]URh[`Rb5(a URhnO?URhS:a-[[S [=URhUR$-55nOSnWUl8URrcSO URrn[uU5U :wa[S[uU5U 4-5eUb[wX1[LS 9nU b UbX;-nOU nUcURxU -nO#URx[R "U5-nURn[]U[z5(d[U (a/[|UR"UR.UR65nO;[~UR"UR.U 5nO[2R"U5n[ U5(a[O[nURnURcSnGON 0PDA <$< *+& &)$/ MM!  $ 66Q; 1g&A''!*  ( + ADM DO  ,WWQZ 4I4??+-/YYqAwt-T* QT? $$Y/&&yq'9:,A  ,(=%%z)%!hhtbggFDO 1gt $ .agg6H6H$$Qf5A.2nn.DBHHRXX&**$.. d++W-=-= > >#44 #D$9$9I$EF  d,,g.>.> ? ? $ 6 6  $T%;%;i%G H  #A'8 9  117G3GH d'' - -  F*"1c"''$2E2E*F&GH ""f,"1c"''$2E2E*F&GH    &..L ))7+;+; < <,,L  3&"1c$*;*;d>Q>Q*Q&RS  )#22:@S@S q6Y Iq69%&   $0PM ,( - E 5   ";;iGO";;bff]>SSONN )Y// (8OOT__ )8)T  i0I(0 $ ==    % M" WJJt'9'9:M""1%3 ))/ 0C0CA0FPQ )S!# z B 66+,,*,))M*B' 346JJ}BGGDMT""??1%)$)# $--22 /""  H   d114??DOOTDJ##!t.bgg> DJ A +! ** G+! **G  djj! V ??a M$$7$7"ooa0DO MM!,DM  r[c \U(aURU5(aSnOSn[UU[SSUS9n[U5(a[URR [ R:wd(URR [ R:wa [S5eU$[XSS9 U$)z6Validate the training data on predict (probabilities).z allow-nanTcsrF)rrresetrr)r) rjrrrrrrurrrr)rWrir=rs rX_validate_X_predict$BaseDecisionTree._validate_X_predicts ++A..$/!$(!#"3 A{{ 277*ahhnn.G !VWW dU 3r[c[U5 URX5nURRU5nURSn[ U5(aUR S:Xa-URR[R"USS9SS9$URSRn[R"X@R 4US9n[UR 5HAnURUR[R"USS2U4SS9SS9USS2U4'MC U$UR S:Xa USS2S4$USS2SS2S4$)aPredict class or regression value for X. For a classification model, the predicted class for each sample in X is returned. For a regression model, the predicted value based on X is returned. Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) The input samples. Internally, it will be converted to ``dtype=np.float32`` and if a sparse matrix is provided to a sparse ``csr_matrix``. check_input : bool, default=True Allow to bypass several input checking. Don't use this parameter unless you know what you're doing. Returns ------- y : array-like of shape (n_samples,) or (n_samples, n_outputs) The predicted classes, or the predict values. rr )axisrN)rrr]predictrrrrtakeruargmaxrrr)rWrir=probar class_type predictionsrs rXrBaseDecisionTree.predicts0.   $ $Q 4 ""1%GGAJ    !#}}))"))E*B)KK"]]1-33  hh ??'C:V t/A(, a(8(=(= %1+A6Q)>)K1%0 #"!#QT{"Q1W~%r[cp[U5 URX5nURRU5$)aReturn the index of the leaf that each sample is predicted as. .. versionadded:: 0.17 Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) The input samples. Internally, it will be converted to ``dtype=np.float32`` and if a sparse matrix is provided to a sparse ``csr_matrix``. check_input : bool, default=True Allow to bypass several input checking. Don't use this parameter unless you know what you're doing. Returns ------- X_leaves : array-like of shape (n_samples,) For each datapoint x in X, return the index of the leaf x ends up in. Leaves are numbered within ``[0; self.tree_.node_count)``, possibly with gaps in the numbering. )rrr]applyrWrir=s rXrBaseDecisionTree.apply-s10   $ $Q 4zz""r[cZURX5nURRU5$)azReturn the decision path in the tree. .. versionadded:: 0.18 Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) The input samples. Internally, it will be converted to ``dtype=np.float32`` and if a sparse matrix is provided to a sparse ``csr_matrix``. check_input : bool, default=True Allow to bypass several input checking. Don't use this parameter unless you know what you're doing. Returns ------- indicator : sparse matrix of shape (n_samples, n_nodes) Return a node indicator CSR matrix where non zero elements indicates that the samples goes through the nodes. )rr] decision_pathrs rXrBaseDecisionTree.decision_pathIs),  $ $Q 4zz''**r[c[U5 URS:Xag[U5(aA[R"UR 5n[ URXR5nOP[ UR[R"S/UR-[RS9UR5n[X RUR5 X l g)z1Prune tree using Minimal Cost-Complexity Pruning.r@Nr r) rrPrrurrr(rrrrr)r])rW n_classes pruned_trees rXrBaseDecisionTree._prune_treebs >>S     doo6It22IOK##!t.bgg> K {JJG r[c[U5RSS9nURXUS9 [S0[ UR 5D6$)aCompute the pruning path during Minimal Cost-Complexity Pruning. See :ref:`minimal_cost_complexity_pruning` for details on the pruning process. Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) The training input samples. Internally, it will be converted to ``dtype=np.float32`` and if a sparse matrix is provided to a sparse ``csc_matrix``. y : array-like of shape (n_samples,) or (n_samples, n_outputs) The target values (class labels) as integers or strings. sample_weight : array-like of shape (n_samples,), default=None Sample weights. If None, then samples are equally weighted. Splits that would create child nodes with net zero or negative weight are ignored while searching for a split in each node. Splits are also ignored if they would result in any single class carrying a negative weight in either child node. Returns ------- ccp_path : :class:`~sklearn.utils.Bunch` Dictionary-like object, with the following attributes. ccp_alphas : ndarray Effective alphas of subtree during pruning. impurities : ndarray Sum of the impurities of the subtree leaves for the corresponding alpha value in ``ccp_alphas``. r@)rP)r)r set_paramsfitrr*r])rWrirrests rXcost_complexity_pruning_path-BaseDecisionTree.cost_complexity_pruning_pathxsDFDk$$s$3 M23' 233r[cL[U5 URR5$)aReturn the feature importances. The importance of a feature is computed as the (normalized) total reduction of the criterion brought by that feature. It is also known as the Gini importance. Warning: impurity-based feature importances can be misleading for high cardinality features (many unique values). See :func:`sklearn.inspection.permutation_importance` as an alternative. Returns ------- feature_importances_ : ndarray of shape (n_features,) Normalized total reduction of criteria by feature (Gini importance). )rr]compute_feature_importancesr^s rXfeature_importances_%BaseDecisionTree.feature_importances_s$ zz5577r[cF>[TU]5nSURlU$NT)superrfrgsparse)rWtagsrrs rXrf!BaseDecisionTree.__sklearn_tags__s!w')!% r[)rPrSrrVrIrMrrNrOrKrJrLrQrrrrGrHr]rU)NTNT)"rs __module__ __qualname____firstlineno____doc__r UNUSED,_BaseDecisionTree__metadata_request__predictrrrrrrRrt__annotations__rrYr_rcrjr}rrrrrrrpropertyrrf__static_attributes__ __classcell__rrs@rXr;r;[s$12B2I2I"J  234xD@$G Xq$v 6 Zc' : Xq$v 6 Zc) < &.dCV%L$M Xq$v 6 Zc' : ' (   ((#HafEtL"*4d6"J!KtS$v>?&--$D2++> $ # &.X'+ yv01&f#8+2!,%4N88*r[r;) metaclassc*^\rSrSr%SrS\R 0rS\R 0r0\ RE\ "1Sk5\ "\ 5/\\\ "S15S/S.Er \\S'S S SS S S SSSS SS SS. U4Sjjr\"SS9SU4Sjj5rSSjrSrU4SjrSrU=r$)r,ias&A decision tree classifier. Read more in the :ref:`User Guide `. Parameters ---------- criterion : {"gini", "entropy", "log_loss"}, default="gini" The function to measure the quality of a split. Supported criteria are "gini" for the Gini impurity and "log_loss" and "entropy" both for the Shannon information gain, see :ref:`tree_mathematical_formulation`. splitter : {"best", "random"}, default="best" The strategy used to choose the split at each node. Supported strategies are "best" to choose the best split and "random" to choose the best random split. max_depth : int, default=None The maximum depth of the tree. If None, then nodes are expanded until all leaves are pure or until all leaves contain less than min_samples_split samples. min_samples_split : int or float, default=2 The minimum number of samples required to split an internal node: - If int, then consider `min_samples_split` as the minimum number. - If float, then `min_samples_split` is a fraction and `ceil(min_samples_split * n_samples)` are the minimum number of samples for each split. .. versionchanged:: 0.18 Added float values for fractions. min_samples_leaf : int or float, default=1 The minimum number of samples required to be at a leaf node. A split point at any depth will only be considered if it leaves at least ``min_samples_leaf`` training samples in each of the left and right branches. This may have the effect of smoothing the model, especially in regression. - If int, then consider `min_samples_leaf` as the minimum number. - If float, then `min_samples_leaf` is a fraction and `ceil(min_samples_leaf * n_samples)` are the minimum number of samples for each node. .. versionchanged:: 0.18 Added float values for fractions. min_weight_fraction_leaf : float, default=0.0 The minimum weighted fraction of the sum total of weights (of all the input samples) required to be at a leaf node. Samples have equal weight when sample_weight is not provided. max_features : int, float or {"sqrt", "log2"}, default=None The number of features to consider when looking for the best split: - If int, then consider `max_features` features at each split. - If float, then `max_features` is a fraction and `max(1, int(max_features * n_features_in_))` features are considered at each split. - If "sqrt", then `max_features=sqrt(n_features)`. - If "log2", then `max_features=log2(n_features)`. - If None, then `max_features=n_features`. .. note:: The search for a split does not stop until at least one valid partition of the node samples is found, even if it requires to effectively inspect more than ``max_features`` features. random_state : int, RandomState instance or None, default=None Controls the randomness of the estimator. The features are always randomly permuted at each split, even if ``splitter`` is set to ``"best"``. When ``max_features < n_features``, the algorithm will select ``max_features`` at random at each split before finding the best split among them. But the best found split may vary across different runs, even if ``max_features=n_features``. That is the case, if the improvement of the criterion is identical for several splits and one split has to be selected at random. To obtain a deterministic behaviour during fitting, ``random_state`` has to be fixed to an integer. See :term:`Glossary ` for details. max_leaf_nodes : int, default=None Grow a tree with ``max_leaf_nodes`` in best-first fashion. Best nodes are defined as relative reduction in impurity. If None then unlimited number of leaf nodes. min_impurity_decrease : float, default=0.0 A node will be split if this split induces a decrease of the impurity greater than or equal to this value. The weighted impurity decrease equation is the following:: N_t / N * (impurity - N_t_R / N_t * right_impurity - N_t_L / N_t * left_impurity) where ``N`` is the total number of samples, ``N_t`` is the number of samples at the current node, ``N_t_L`` is the number of samples in the left child, and ``N_t_R`` is the number of samples in the right child. ``N``, ``N_t``, ``N_t_R`` and ``N_t_L`` all refer to the weighted sum, if ``sample_weight`` is passed. .. versionadded:: 0.19 class_weight : dict, list of dict or "balanced", default=None Weights associated with classes in the form ``{class_label: weight}``. If None, all classes are supposed to have weight one. For multi-output problems, a list of dicts can be provided in the same order as the columns of y. Note that for multioutput (including multilabel) weights should be defined for each class of every column in its own dict. For example, for four-class multilabel classification weights should be [{0: 1, 1: 1}, {0: 1, 1: 5}, {0: 1, 1: 1}, {0: 1, 1: 1}] instead of [{1:1}, {2:5}, {3:1}, {4:1}]. The "balanced" mode uses the values of y to automatically adjust weights inversely proportional to class frequencies in the input data as ``n_samples / (n_classes * np.bincount(y))`` For multi-output, the weights of each column of y will be multiplied. Note that these weights will be multiplied with sample_weight (passed through the fit method) if sample_weight is specified. ccp_alpha : non-negative float, default=0.0 Complexity parameter used for Minimal Cost-Complexity Pruning. The subtree with the largest cost complexity that is smaller than ``ccp_alpha`` will be chosen. By default, no pruning is performed. See :ref:`minimal_cost_complexity_pruning` for details. See :ref:`sphx_glr_auto_examples_tree_plot_cost_complexity_pruning.py` for an example of such pruning. .. versionadded:: 0.22 monotonic_cst : array-like of int of shape (n_features), default=None Indicates the monotonicity constraint to enforce on each feature. - 1: monotonic increase - 0: no constraint - -1: monotonic decrease If monotonic_cst is None, no constraints are applied. Monotonicity constraints are not supported for: - multiclass classifications (i.e. when `n_classes > 2`), - multioutput classifications (i.e. when `n_outputs_ > 1`), - classifications trained on data with missing values. The constraints hold over the probability of the positive class. Read more in the :ref:`User Guide `. .. versionadded:: 1.4 Attributes ---------- classes_ : ndarray of shape (n_classes,) or list of ndarray The classes labels (single output problem), or a list of arrays of class labels (multi-output problem). feature_importances_ : ndarray of shape (n_features,) The impurity-based feature importances. The higher, the more important the feature. The importance of a feature is computed as the (normalized) total reduction of the criterion brought by that feature. It is also known as the Gini importance [4]_. Warning: impurity-based feature importances can be misleading for high cardinality features (many unique values). See :func:`sklearn.inspection.permutation_importance` as an alternative. max_features_ : int The inferred value of max_features. n_classes_ : int or list of int The number of classes (for single output problems), or a list containing the number of classes for each output (for multi-output problems). n_features_in_ : int Number of features seen during :term:`fit`. .. versionadded:: 0.24 feature_names_in_ : ndarray of shape (`n_features_in_`,) Names of features seen during :term:`fit`. Defined only when `X` has feature names that are all strings. .. versionadded:: 1.0 n_outputs_ : int The number of outputs when ``fit`` is performed. tree_ : Tree instance The underlying Tree object. Please refer to ``help(sklearn.tree._tree.Tree)`` for attributes of Tree object and :ref:`sphx_glr_auto_examples_tree_plot_unveil_tree_structure.py` for basic usage of these attributes. See Also -------- DecisionTreeRegressor : A decision tree regressor. Notes ----- The default values for the parameters controlling the size of the trees (e.g. ``max_depth``, ``min_samples_leaf``, etc.) lead to fully grown and unpruned trees which can potentially be very large on some data sets. To reduce memory consumption, the complexity and size of the trees should be controlled by setting those parameter values. The :meth:`predict` method operates using the :func:`numpy.argmax` function on the outputs of :meth:`predict_proba`. This means that in case the highest predicted probabilities are tied, the classifier will predict the tied class with the lowest index in :term:`classes_`. References ---------- .. [1] https://en.wikipedia.org/wiki/Decision_tree_learning .. [2] L. Breiman, J. Friedman, R. Olshen, and C. Stone, "Classification and Regression Trees", Wadsworth, Belmont, CA, 1984. .. [3] T. Hastie, R. Tibshirani and J. Friedman. "Elements of Statistical Learning", Springer, 2009. .. [4] L. Breiman, and A. Cutler, "Random Forests", https://www.stat.berkeley.edu/~breiman/RandomForests/cc_home.htm Examples -------- >>> from sklearn.datasets import load_iris >>> from sklearn.model_selection import cross_val_score >>> from sklearn.tree import DecisionTreeClassifier >>> clf = DecisionTreeClassifier(random_state=0) >>> iris = load_iris() >>> cross_val_score(clf, iris.data, iris.target, cv=10) ... # doctest: +SKIP ... array([ 1. , 0.93, 0.86, 0.93, 0.93, 0.93, 0.93, 1. , 0.93, 1. ]) r=>r0r2r1balancedN)rVrSrRr0r8r r r@ rVrHrIrJrKrLrMrGrNrOrSrPrQc 8>[TU]UUUUUUUU U UU U U S9 g)N) rVrHrIrJrKrLrMrNrSrGrOrQrPrrYrWrVrHrIrJrKrLrMrGrNrOrSrPrQrrs rXrYDecisionTreeClassifier.__init__s>" /-%=%)%%"7'  r[Tprefer_skip_nested_validationc(>[TU]UUUUS9 U$)aBuild a decision tree classifier from the training set (X, y). Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) The training input samples. Internally, it will be converted to ``dtype=np.float32`` and if a sparse matrix is provided to a sparse ``csc_matrix``. y : array-like of shape (n_samples,) or (n_samples, n_outputs) The target values (class labels) as integers or strings. sample_weight : array-like of shape (n_samples,), default=None Sample weights. If None, then samples are equally weighted. Splits that would create child nodes with net zero or negative weight are ignored while searching for a split in each node. Splits are also ignored if they would result in any single class carrying a negative weight in either child node. check_input : bool, default=True Allow to bypass several input checking. Don't use this parameter unless you know what you're doing. Returns ------- self : DecisionTreeClassifier Fitted estimator. rr=rrrWrirrr=rrs rXrDecisionTreeClassifier.fits)>  '#   r[cN[U5 URX5nURRU5nURS:XaUSS2SUR 24$/n[ UR5H-nUSS2USUR U24nURU5 M/ U$)aPredict class probabilities of the input samples X. The predicted class probability is the fraction of samples of the same class in a leaf. Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) The input samples. Internally, it will be converted to ``dtype=np.float32`` and if a sparse matrix is provided to a sparse ``csr_matrix``. check_input : bool, default=True Allow to bypass several input checking. Don't use this parameter unless you know what you're doing. Returns ------- proba : ndarray of shape (n_samples, n_classes) or list of n_outputs such arrays if n_outputs > 1 The class probabilities of the input samples. The order of the classes corresponds to that in the attribute :term:`classes_`. r N)rrr]rrrrr)rWrir=r all_probarproba_ks rX predict_proba$DecisionTreeClassifier.predict_probas0   $ $Q 4 ""1% ??a -doo--. .I4??+1&:(:&: :;  ), r[cURU5nURS:Xa[R"U5$[ UR5Hn[R"X#5X#'M U$)a0Predict class log-probabilities of the input samples X. Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) The input samples. Internally, it will be converted to ``dtype=np.float32`` and if a sparse matrix is provided to a sparse ``csr_matrix``. Returns ------- proba : ndarray of shape (n_samples, n_classes) or list of n_outputs such arrays if n_outputs > 1 The class log-probabilities of the input samples. The order of the classes corresponds to that in the attribute :term:`classes_`. r )rrrulogr)rWrirrs rXpredict_log_proba(DecisionTreeClassifier.predict_log_proba-s\"""1% ??a 66%= 4??+66%(+,Lr[c>[TU]5nURS;=(a URS;nSURlX!R lU$)Nr7>r0r2r1TrrfrHrVclassifier_tags multi_labelrgrhrWrrhrrs rXrf'DecisionTreeClassifier.__sklearn_tags__IsVw')MM%77 DNNO = ,0($-! r[rrr)rsrrrrr r8_DecisionTreeClassifier__metadata_request__predict_proba._DecisionTreeClassifier__metadata_request__fitr;rRrrr$rtlistrrYrrrrrfrrrs@rXr,r,srl*78H8O8O(P%,.>.E.EF$  1 1$ !@A6)CTUtZ %=tD$D!$!  B5$6$L#J8  r[r,c ^\rSrSr%SrS\R 0r0\RES\ "1Sk5\ "\ 5/0Er \ \S'SSS S S S S S S S S S S . U4Sjjr\"SS9SU4Sjj5rSrU4SjrSrU=r$)r-iWa!A decision tree regressor. Read more in the :ref:`User Guide `. Parameters ---------- criterion : {"squared_error", "friedman_mse", "absolute_error", "poisson"}, default="squared_error" The function to measure the quality of a split. Supported criteria are "squared_error" for the mean squared error, which is equal to variance reduction as feature selection criterion and minimizes the L2 loss using the mean of each terminal node, "friedman_mse", which uses mean squared error with Friedman's improvement score for potential splits, "absolute_error" for the mean absolute error, which minimizes the L1 loss using the median of each terminal node, and "poisson" which uses reduction in the half mean Poisson deviance to find splits. .. versionadded:: 0.18 Mean Absolute Error (MAE) criterion. .. versionadded:: 0.24 Poisson deviance criterion. splitter : {"best", "random"}, default="best" The strategy used to choose the split at each node. Supported strategies are "best" to choose the best split and "random" to choose the best random split. max_depth : int, default=None The maximum depth of the tree. If None, then nodes are expanded until all leaves are pure or until all leaves contain less than min_samples_split samples. For an example of how ``max_depth`` influences the model, see :ref:`sphx_glr_auto_examples_tree_plot_tree_regression.py`. min_samples_split : int or float, default=2 The minimum number of samples required to split an internal node: - If int, then consider `min_samples_split` as the minimum number. - If float, then `min_samples_split` is a fraction and `ceil(min_samples_split * n_samples)` are the minimum number of samples for each split. .. versionchanged:: 0.18 Added float values for fractions. min_samples_leaf : int or float, default=1 The minimum number of samples required to be at a leaf node. A split point at any depth will only be considered if it leaves at least ``min_samples_leaf`` training samples in each of the left and right branches. This may have the effect of smoothing the model, especially in regression. - If int, then consider `min_samples_leaf` as the minimum number. - If float, then `min_samples_leaf` is a fraction and `ceil(min_samples_leaf * n_samples)` are the minimum number of samples for each node. .. versionchanged:: 0.18 Added float values for fractions. min_weight_fraction_leaf : float, default=0.0 The minimum weighted fraction of the sum total of weights (of all the input samples) required to be at a leaf node. Samples have equal weight when sample_weight is not provided. max_features : int, float or {"sqrt", "log2"}, default=None The number of features to consider when looking for the best split: - If int, then consider `max_features` features at each split. - If float, then `max_features` is a fraction and `max(1, int(max_features * n_features_in_))` features are considered at each split. - If "sqrt", then `max_features=sqrt(n_features)`. - If "log2", then `max_features=log2(n_features)`. - If None, then `max_features=n_features`. Note: the search for a split does not stop until at least one valid partition of the node samples is found, even if it requires to effectively inspect more than ``max_features`` features. random_state : int, RandomState instance or None, default=None Controls the randomness of the estimator. The features are always randomly permuted at each split, even if ``splitter`` is set to ``"best"``. When ``max_features < n_features``, the algorithm will select ``max_features`` at random at each split before finding the best split among them. But the best found split may vary across different runs, even if ``max_features=n_features``. That is the case, if the improvement of the criterion is identical for several splits and one split has to be selected at random. To obtain a deterministic behaviour during fitting, ``random_state`` has to be fixed to an integer. See :term:`Glossary ` for details. max_leaf_nodes : int, default=None Grow a tree with ``max_leaf_nodes`` in best-first fashion. Best nodes are defined as relative reduction in impurity. If None then unlimited number of leaf nodes. min_impurity_decrease : float, default=0.0 A node will be split if this split induces a decrease of the impurity greater than or equal to this value. The weighted impurity decrease equation is the following:: N_t / N * (impurity - N_t_R / N_t * right_impurity - N_t_L / N_t * left_impurity) where ``N`` is the total number of samples, ``N_t`` is the number of samples at the current node, ``N_t_L`` is the number of samples in the left child, and ``N_t_R`` is the number of samples in the right child. ``N``, ``N_t``, ``N_t_R`` and ``N_t_L`` all refer to the weighted sum, if ``sample_weight`` is passed. .. versionadded:: 0.19 ccp_alpha : non-negative float, default=0.0 Complexity parameter used for Minimal Cost-Complexity Pruning. The subtree with the largest cost complexity that is smaller than ``ccp_alpha`` will be chosen. By default, no pruning is performed. See :ref:`minimal_cost_complexity_pruning` for details. See :ref:`sphx_glr_auto_examples_tree_plot_cost_complexity_pruning.py` for an example of such pruning. .. versionadded:: 0.22 monotonic_cst : array-like of int of shape (n_features), default=None Indicates the monotonicity constraint to enforce on each feature. - 1: monotonic increase - 0: no constraint - -1: monotonic decrease If monotonic_cst is None, no constraints are applied. Monotonicity constraints are not supported for: - multioutput regressions (i.e. when `n_outputs_ > 1`), - regressions trained on data with missing values. Read more in the :ref:`User Guide `. .. versionadded:: 1.4 Attributes ---------- feature_importances_ : ndarray of shape (n_features,) The feature importances. The higher, the more important the feature. The importance of a feature is computed as the (normalized) total reduction of the criterion brought by that feature. It is also known as the Gini importance [4]_. Warning: impurity-based feature importances can be misleading for high cardinality features (many unique values). See :func:`sklearn.inspection.permutation_importance` as an alternative. max_features_ : int The inferred value of max_features. n_features_in_ : int Number of features seen during :term:`fit`. .. versionadded:: 0.24 feature_names_in_ : ndarray of shape (`n_features_in_`,) Names of features seen during :term:`fit`. Defined only when `X` has feature names that are all strings. .. versionadded:: 1.0 n_outputs_ : int The number of outputs when ``fit`` is performed. tree_ : Tree instance The underlying Tree object. Please refer to ``help(sklearn.tree._tree.Tree)`` for attributes of Tree object and :ref:`sphx_glr_auto_examples_tree_plot_unveil_tree_structure.py` for basic usage of these attributes. See Also -------- DecisionTreeClassifier : A decision tree classifier. Notes ----- The default values for the parameters controlling the size of the trees (e.g. ``max_depth``, ``min_samples_leaf``, etc.) lead to fully grown and unpruned trees which can potentially be very large on some data sets. To reduce memory consumption, the complexity and size of the trees should be controlled by setting those parameter values. References ---------- .. [1] https://en.wikipedia.org/wiki/Decision_tree_learning .. [2] L. Breiman, J. Friedman, R. Olshen, and C. Stone, "Classification and Regression Trees", Wadsworth, Belmont, CA, 1984. .. [3] T. Hastie, R. Tibshirani and J. Friedman. "Elements of Statistical Learning", Springer, 2009. .. [4] L. Breiman, and A. Cutler, "Random Forests", https://www.stat.berkeley.edu/~breiman/RandomForests/cc_home.htm Examples -------- >>> from sklearn.datasets import load_diabetes >>> from sklearn.model_selection import cross_val_score >>> from sklearn.tree import DecisionTreeRegressor >>> X, y = load_diabetes(return_X_y=True) >>> regressor = DecisionTreeRegressor(random_state=0) >>> cross_val_score(regressor, X, y, cv=10) ... # doctest: +SKIP ... array([-0.39, -0.46, 0.02, 0.06, -0.50, 0.16, 0.11, -0.73, -0.30, -0.00]) r=rV>r6r4r3r5rRr3r8Nr r r@) rVrHrIrJrKrLrMrGrNrOrPrQc 6>[T U]UUUUUUUU UU U U S9 g)N) rVrHrIrJrKrLrMrNrGrOrPrQr)rWrVrHrIrJrKrLrMrGrNrOrPrQrrs rXrYDecisionTreeRegressor.__init__?s; /-%=%)%"7'  r[Tr c(>[TU]UUUUS9 U$)aBuild a decision tree regressor from the training set (X, y). Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) The training input samples. Internally, it will be converted to ``dtype=np.float32`` and if a sparse matrix is provided to a sparse ``csc_matrix``. y : array-like of shape (n_samples,) or (n_samples, n_outputs) The target values (real numbers). Use ``dtype=np.float64`` and ``order='C'`` for maximum efficiency. sample_weight : array-like of shape (n_samples,), default=None Sample weights. If None, then samples are equally weighted. Splits that would create child nodes with net zero or negative weight are ignored while searching for a split in each node. check_input : bool, default=True Allow to bypass several input checking. Don't use this parameter unless you know what you're doing. Returns ------- self : DecisionTreeRegressor Fitted estimator. r rrs rXrDecisionTreeRegressor.fit^s)<  '#   r[c[R"U[SS9n[R"URS[R SS9n[R"U[R SS9nURRXU5 U$)aFast partial dependence computation. Parameters ---------- grid : ndarray of shape (n_samples, n_target_features), dtype=np.float32 The grid points on which the partial dependence should be evaluated. target_features : ndarray of shape (n_target_features), dtype=np.intp The set of target features for which the partial dependence should be evaluated. Returns ------- averaged_predictions : ndarray of shape (n_samples,), dtype=np.float64 The value of the partial dependence function on each grid point. C)rorderr)rrr*) rurrrrfloat64rr]compute_partial_dependence)rWgridtarget_featuresaveraged_predictionss rX%_compute_partial_dependence_recursion;DecisionTreeRegressor._compute_partial_dependence_recursionsp"zz$e37!xx**Q-rzz **_BGG3O -- #7 $#r[c>[TU]5nURS;=(a URS;nX!RlU$)Nr7>r6r4r3rrfrHrVrgrhrs rXrf&DecisionTreeRegressor.__sklearn_tags__sHw')MM%77 DNNO = %.! r[rr)rsrrrrr r-_DecisionTreeRegressor__metadata_request__fitr;rRrrr$rtrrYrrr0rfrrrs@rXr-r-WsYz -.>.E.EF$  1 1$ U V 9  $D"!$!  >5#6#J$8  r[r-cX^\rSrSrSrSSSSSSS SSSSSSS . U4S jjrU4S jrS rU=r$)r.ia%An extremely randomized tree classifier. Extra-trees differ from classic decision trees in the way they are built. When looking for the best split to separate the samples of a node into two groups, random splits are drawn for each of the `max_features` randomly selected features and the best split among those is chosen. When `max_features` is set 1, this amounts to building a totally random decision tree. Warning: Extra-trees should only be used within ensemble methods. Read more in the :ref:`User Guide `. Parameters ---------- criterion : {"gini", "entropy", "log_loss"}, default="gini" The function to measure the quality of a split. Supported criteria are "gini" for the Gini impurity and "log_loss" and "entropy" both for the Shannon information gain, see :ref:`tree_mathematical_formulation`. splitter : {"random", "best"}, default="random" The strategy used to choose the split at each node. Supported strategies are "best" to choose the best split and "random" to choose the best random split. max_depth : int, default=None The maximum depth of the tree. If None, then nodes are expanded until all leaves are pure or until all leaves contain less than min_samples_split samples. min_samples_split : int or float, default=2 The minimum number of samples required to split an internal node: - If int, then consider `min_samples_split` as the minimum number. - If float, then `min_samples_split` is a fraction and `ceil(min_samples_split * n_samples)` are the minimum number of samples for each split. .. versionchanged:: 0.18 Added float values for fractions. min_samples_leaf : int or float, default=1 The minimum number of samples required to be at a leaf node. A split point at any depth will only be considered if it leaves at least ``min_samples_leaf`` training samples in each of the left and right branches. This may have the effect of smoothing the model, especially in regression. - If int, then consider `min_samples_leaf` as the minimum number. - If float, then `min_samples_leaf` is a fraction and `ceil(min_samples_leaf * n_samples)` are the minimum number of samples for each node. .. versionchanged:: 0.18 Added float values for fractions. min_weight_fraction_leaf : float, default=0.0 The minimum weighted fraction of the sum total of weights (of all the input samples) required to be at a leaf node. Samples have equal weight when sample_weight is not provided. max_features : int, float, {"sqrt", "log2"} or None, default="sqrt" The number of features to consider when looking for the best split: - If int, then consider `max_features` features at each split. - If float, then `max_features` is a fraction and `max(1, int(max_features * n_features_in_))` features are considered at each split. - If "sqrt", then `max_features=sqrt(n_features)`. - If "log2", then `max_features=log2(n_features)`. - If None, then `max_features=n_features`. .. versionchanged:: 1.1 The default of `max_features` changed from `"auto"` to `"sqrt"`. Note: the search for a split does not stop until at least one valid partition of the node samples is found, even if it requires to effectively inspect more than ``max_features`` features. random_state : int, RandomState instance or None, default=None Used to pick randomly the `max_features` used at each split. See :term:`Glossary ` for details. max_leaf_nodes : int, default=None Grow a tree with ``max_leaf_nodes`` in best-first fashion. Best nodes are defined as relative reduction in impurity. If None then unlimited number of leaf nodes. min_impurity_decrease : float, default=0.0 A node will be split if this split induces a decrease of the impurity greater than or equal to this value. The weighted impurity decrease equation is the following:: N_t / N * (impurity - N_t_R / N_t * right_impurity - N_t_L / N_t * left_impurity) where ``N`` is the total number of samples, ``N_t`` is the number of samples at the current node, ``N_t_L`` is the number of samples in the left child, and ``N_t_R`` is the number of samples in the right child. ``N``, ``N_t``, ``N_t_R`` and ``N_t_L`` all refer to the weighted sum, if ``sample_weight`` is passed. .. versionadded:: 0.19 class_weight : dict, list of dict or "balanced", default=None Weights associated with classes in the form ``{class_label: weight}``. If None, all classes are supposed to have weight one. For multi-output problems, a list of dicts can be provided in the same order as the columns of y. Note that for multioutput (including multilabel) weights should be defined for each class of every column in its own dict. For example, for four-class multilabel classification weights should be [{0: 1, 1: 1}, {0: 1, 1: 5}, {0: 1, 1: 1}, {0: 1, 1: 1}] instead of [{1:1}, {2:5}, {3:1}, {4:1}]. The "balanced" mode uses the values of y to automatically adjust weights inversely proportional to class frequencies in the input data as ``n_samples / (n_classes * np.bincount(y))`` For multi-output, the weights of each column of y will be multiplied. Note that these weights will be multiplied with sample_weight (passed through the fit method) if sample_weight is specified. ccp_alpha : non-negative float, default=0.0 Complexity parameter used for Minimal Cost-Complexity Pruning. The subtree with the largest cost complexity that is smaller than ``ccp_alpha`` will be chosen. By default, no pruning is performed. See :ref:`minimal_cost_complexity_pruning` for details. See :ref:`sphx_glr_auto_examples_tree_plot_cost_complexity_pruning.py` for an example of such pruning. .. versionadded:: 0.22 monotonic_cst : array-like of int of shape (n_features), default=None Indicates the monotonicity constraint to enforce on each feature. - 1: monotonic increase - 0: no constraint - -1: monotonic decrease If monotonic_cst is None, no constraints are applied. Monotonicity constraints are not supported for: - multiclass classifications (i.e. when `n_classes > 2`), - multioutput classifications (i.e. when `n_outputs_ > 1`), - classifications trained on data with missing values. The constraints hold over the probability of the positive class. Read more in the :ref:`User Guide `. .. versionadded:: 1.4 Attributes ---------- classes_ : ndarray of shape (n_classes,) or list of ndarray The classes labels (single output problem), or a list of arrays of class labels (multi-output problem). max_features_ : int The inferred value of max_features. n_classes_ : int or list of int The number of classes (for single output problems), or a list containing the number of classes for each output (for multi-output problems). feature_importances_ : ndarray of shape (n_features,) The impurity-based feature importances. The higher, the more important the feature. The importance of a feature is computed as the (normalized) total reduction of the criterion brought by that feature. It is also known as the Gini importance. Warning: impurity-based feature importances can be misleading for high cardinality features (many unique values). See :func:`sklearn.inspection.permutation_importance` as an alternative. n_features_in_ : int Number of features seen during :term:`fit`. .. versionadded:: 0.24 feature_names_in_ : ndarray of shape (`n_features_in_`,) Names of features seen during :term:`fit`. Defined only when `X` has feature names that are all strings. .. versionadded:: 1.0 n_outputs_ : int The number of outputs when ``fit`` is performed. tree_ : Tree instance The underlying Tree object. Please refer to ``help(sklearn.tree._tree.Tree)`` for attributes of Tree object and :ref:`sphx_glr_auto_examples_tree_plot_unveil_tree_structure.py` for basic usage of these attributes. See Also -------- ExtraTreeRegressor : An extremely randomized tree regressor. sklearn.ensemble.ExtraTreesClassifier : An extra-trees classifier. sklearn.ensemble.ExtraTreesRegressor : An extra-trees regressor. sklearn.ensemble.RandomForestClassifier : A random forest classifier. sklearn.ensemble.RandomForestRegressor : A random forest regressor. sklearn.ensemble.RandomTreesEmbedding : An ensemble of totally random trees. Notes ----- The default values for the parameters controlling the size of the trees (e.g. ``max_depth``, ``min_samples_leaf``, etc.) lead to fully grown and unpruned trees which can potentially be very large on some data sets. To reduce memory consumption, the complexity and size of the trees should be controlled by setting those parameter values. References ---------- .. [1] P. Geurts, D. Ernst., and L. Wehenkel, "Extremely randomized trees", Machine Learning, 63(1), 3-42, 2006. Examples -------- >>> from sklearn.datasets import load_iris >>> from sklearn.model_selection import train_test_split >>> from sklearn.ensemble import BaggingClassifier >>> from sklearn.tree import ExtraTreeClassifier >>> X, y = load_iris(return_X_y=True) >>> X_train, X_test, y_train, y_test = train_test_split( ... X, y, random_state=0) >>> extra_tree = ExtraTreeClassifier(random_state=0) >>> cls = BaggingClassifier(extra_tree, random_state=0).fit( ... X_train, y_train) >>> cls.score(X_test, y_test) 0.8947 r0r9Nr r r@rErc 8>[TU]UUUUUUUU U U UU U S9 g)N) rVrHrIrJrKrLrMrNrSrOrGrPrQrrs rXrYExtraTreeClassifier.__init__s>" /-%=%)%"7%'  r[c>[TU]5nURS:H=(a URS;nSURlX!R lU$)Nr9>r0r2r1Trrs rXrf$ExtraTreeClassifier.__sklearn_tags__sUw')MMX- $..E 3 ,0($-! r[r rsrrrrrYrfrrrs@rXr.r.sHoh!$!  B  r[r.c V^\rSrSrSrSSSSSSS SSSSSS . U4S jjrU4S jrS rU=r$)r/iaO An extremely randomized tree regressor. Extra-trees differ from classic decision trees in the way they are built. When looking for the best split to separate the samples of a node into two groups, random splits are drawn for each of the `max_features` randomly selected features and the best split among those is chosen. When `max_features` is set 1, this amounts to building a totally random decision tree. Warning: Extra-trees should only be used within ensemble methods. Read more in the :ref:`User Guide `. Parameters ---------- criterion : {"squared_error", "friedman_mse", "absolute_error", "poisson"}, default="squared_error" The function to measure the quality of a split. Supported criteria are "squared_error" for the mean squared error, which is equal to variance reduction as feature selection criterion and minimizes the L2 loss using the mean of each terminal node, "friedman_mse", which uses mean squared error with Friedman's improvement score for potential splits, "absolute_error" for the mean absolute error, which minimizes the L1 loss using the median of each terminal node, and "poisson" which uses reduction in Poisson deviance to find splits. .. versionadded:: 0.18 Mean Absolute Error (MAE) criterion. .. versionadded:: 0.24 Poisson deviance criterion. splitter : {"random", "best"}, default="random" The strategy used to choose the split at each node. Supported strategies are "best" to choose the best split and "random" to choose the best random split. max_depth : int, default=None The maximum depth of the tree. If None, then nodes are expanded until all leaves are pure or until all leaves contain less than min_samples_split samples. min_samples_split : int or float, default=2 The minimum number of samples required to split an internal node: - If int, then consider `min_samples_split` as the minimum number. - If float, then `min_samples_split` is a fraction and `ceil(min_samples_split * n_samples)` are the minimum number of samples for each split. .. versionchanged:: 0.18 Added float values for fractions. min_samples_leaf : int or float, default=1 The minimum number of samples required to be at a leaf node. A split point at any depth will only be considered if it leaves at least ``min_samples_leaf`` training samples in each of the left and right branches. This may have the effect of smoothing the model, especially in regression. - If int, then consider `min_samples_leaf` as the minimum number. - If float, then `min_samples_leaf` is a fraction and `ceil(min_samples_leaf * n_samples)` are the minimum number of samples for each node. .. versionchanged:: 0.18 Added float values for fractions. min_weight_fraction_leaf : float, default=0.0 The minimum weighted fraction of the sum total of weights (of all the input samples) required to be at a leaf node. Samples have equal weight when sample_weight is not provided. max_features : int, float, {"sqrt", "log2"} or None, default=1.0 The number of features to consider when looking for the best split: - If int, then consider `max_features` features at each split. - If float, then `max_features` is a fraction and `max(1, int(max_features * n_features_in_))` features are considered at each split. - If "sqrt", then `max_features=sqrt(n_features)`. - If "log2", then `max_features=log2(n_features)`. - If None, then `max_features=n_features`. .. versionchanged:: 1.1 The default of `max_features` changed from `"auto"` to `1.0`. Note: the search for a split does not stop until at least one valid partition of the node samples is found, even if it requires to effectively inspect more than ``max_features`` features. random_state : int, RandomState instance or None, default=None Used to pick randomly the `max_features` used at each split. See :term:`Glossary ` for details. min_impurity_decrease : float, default=0.0 A node will be split if this split induces a decrease of the impurity greater than or equal to this value. The weighted impurity decrease equation is the following:: N_t / N * (impurity - N_t_R / N_t * right_impurity - N_t_L / N_t * left_impurity) where ``N`` is the total number of samples, ``N_t`` is the number of samples at the current node, ``N_t_L`` is the number of samples in the left child, and ``N_t_R`` is the number of samples in the right child. ``N``, ``N_t``, ``N_t_R`` and ``N_t_L`` all refer to the weighted sum, if ``sample_weight`` is passed. .. versionadded:: 0.19 max_leaf_nodes : int, default=None Grow a tree with ``max_leaf_nodes`` in best-first fashion. Best nodes are defined as relative reduction in impurity. If None then unlimited number of leaf nodes. ccp_alpha : non-negative float, default=0.0 Complexity parameter used for Minimal Cost-Complexity Pruning. The subtree with the largest cost complexity that is smaller than ``ccp_alpha`` will be chosen. By default, no pruning is performed. See :ref:`minimal_cost_complexity_pruning` for details. See :ref:`sphx_glr_auto_examples_tree_plot_cost_complexity_pruning.py` for an example of such pruning. .. versionadded:: 0.22 monotonic_cst : array-like of int of shape (n_features), default=None Indicates the monotonicity constraint to enforce on each feature. - 1: monotonic increase - 0: no constraint - -1: monotonic decrease If monotonic_cst is None, no constraints are applied. Monotonicity constraints are not supported for: - multioutput regressions (i.e. when `n_outputs_ > 1`), - regressions trained on data with missing values. Read more in the :ref:`User Guide `. .. versionadded:: 1.4 Attributes ---------- max_features_ : int The inferred value of max_features. n_features_in_ : int Number of features seen during :term:`fit`. .. versionadded:: 0.24 feature_names_in_ : ndarray of shape (`n_features_in_`,) Names of features seen during :term:`fit`. Defined only when `X` has feature names that are all strings. .. versionadded:: 1.0 feature_importances_ : ndarray of shape (n_features,) Return impurity-based feature importances (the higher, the more important the feature). Warning: impurity-based feature importances can be misleading for high cardinality features (many unique values). See :func:`sklearn.inspection.permutation_importance` as an alternative. n_outputs_ : int The number of outputs when ``fit`` is performed. tree_ : Tree instance The underlying Tree object. Please refer to ``help(sklearn.tree._tree.Tree)`` for attributes of Tree object and :ref:`sphx_glr_auto_examples_tree_plot_unveil_tree_structure.py` for basic usage of these attributes. See Also -------- ExtraTreeClassifier : An extremely randomized tree classifier. sklearn.ensemble.ExtraTreesClassifier : An extra-trees classifier. sklearn.ensemble.ExtraTreesRegressor : An extra-trees regressor. Notes ----- The default values for the parameters controlling the size of the trees (e.g. ``max_depth``, ``min_samples_leaf``, etc.) lead to fully grown and unpruned trees which can potentially be very large on some data sets. To reduce memory consumption, the complexity and size of the trees should be controlled by setting those parameter values. References ---------- .. [1] P. Geurts, D. Ernst., and L. Wehenkel, "Extremely randomized trees", Machine Learning, 63(1), 3-42, 2006. Examples -------- >>> from sklearn.datasets import load_diabetes >>> from sklearn.model_selection import train_test_split >>> from sklearn.ensemble import BaggingRegressor >>> from sklearn.tree import ExtraTreeRegressor >>> X, y = load_diabetes(return_X_y=True) >>> X_train, X_test, y_train, y_test = train_test_split( ... X, y, random_state=0) >>> extra_tree = ExtraTreeRegressor(random_state=0) >>> reg = BaggingRegressor(extra_tree, random_state=0).fit( ... X_train, y_train) >>> reg.score(X_test, y_test) 0.33 r3r9Nr r r@rA) rVrHrIrJrKrLrMrGrOrNrPrQc 6>[T U]UUUUUUUU U UU U S9 g)N) rVrHrIrJrKrLrMrNrOrGrPrQr)rWrVrHrIrJrKrLrMrGrOrNrPrQrrs rXrYExtraTreeRegressor.__init__s; /-%=%)"7%'  r[c>[TU]5nURS:H=(a URS;nX!RlU$)Nr9>r6r4r3r3rs rXrf#ExtraTreeRegressor.__sklearn_tags__sGw')MMX- $..E 3 %.! r[rr;rs@rXr/r/sDSp"!$!  >  r[r/)Mrrrabcrrmathrrrnumpyru scipy.sparser sklearn.utilsr baser r r rrrrutilsrrrutils._param_validationrrrrutils.multiclassrutils.validationrrrrrrr!r"r#r$r%r&r'r(r)r*_utilsr+__all__rrGiniEntropyrMSE FriedmanMSEMAEPoissonr BestSplitterRandomSplitterrBestSparseSplitterRandomSparseSplitterrr;r,r-r.r/rr[rXrXs] '"!*EDNN;+*!%     OO""!!  ^^** nn!!  %11Y=U=UV  ( (,,] ''] JT_.>Tn SN,<Sl ^0^B .r[