ZPhȁdZddlZddlmZddlmZddlZddlmZ ddlm Z ddl m Z ddlmZmZdd lmZdd lmZdd lmZmZmZdd lmZdd lmZddlmZmZddl m!Z!m"Z"m#Z#ddl$m%Z%ddl&m'Z'ddl(m)Z)m*Z*ddl+m,Z,ddl-m.Z.ddl/m0Z0ddl1m2Z2ddl3m4Z4m5Z5ddl6m7Z7m8Z8m9Z9ddl:m;Z;ddlej?j@ZA d!dZBe2e4e5Gdd eZCdS)"z9Forest classifiers trained on balanced boostrasp samples.N)deepcopy)warn)float32)float64)issparse)clone is_classifier)RandomForestClassifier)_set_random_states)_generate_unsampled_indices_get_n_samples_bootstrap_parallel_build_trees)DataConversionWarning)DecisionTreeClassifier)_safe_indexingcheck_random_state)HiddenInterval StrOptions) parse_version)type_of_target)Paralleldelayed)_check_sample_weight) make_pipeline)RandomUnderSampler) Substitution)_n_jobs_docstring_random_state_docstring) _fit_contextsklearn_version validate_data)check_sampling_strategy)/_random_forest_classifier_parameter_constraintsc |||\} }|t||j}tt | | jd} || |||||| | |d }t tdkr| |d<tdi|}||fS)Nr) treeXy sample_weighttree_idxn_treesverbose class_weightn_samples_bootstrap bootstrap1.4missing_values_in_feature_mask) fit_resamplersample_indices_r minshaper"rr)samplerr(r1r)r*r+r,r-r.r/r0forestr3 X_resampled y_resampledparams_parallel_build_treess Y/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/imblearn/ensemble/_forest.py_local_parallel_build_treesr?*s '33Aq99K &}g6MNN +!"5{7H7KLL  &$2 # #-.... + $$DE ! ? ?#> ? ?D D=)n_jobs random_stateceZdZdZeedkreejZn ee Ze de e dhge ejddde hd eee e dhgde e dhgd  dd d ddddd dddddd d ddd dd d dfd ZefdZddZedddZdZdZdZfdZxZS) BalancedRandomForestClassifieraH4A balanced random forest classifier. A balanced random forest differs from a classical random forest by the fact that it will draw a bootstrap sample from the minority class and sample with replacement the same number of samples from the majority class. Read more in the :ref:`User Guide `. .. versionadded:: 0.4 Parameters ---------- n_estimators : int, default=100 The number of trees in the forest. criterion : {{"gini", "entropy"}}, default="gini" The function to measure the quality of a split. Supported criteria are "gini" for the Gini impurity and "entropy" for the information gain. Note: this parameter is tree-specific. 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 percentage and `ceil(min_samples_split * n_samples)` are the minimum number of samples for each split. min_samples_leaf : int or float, default=1 The minimum number of samples required to be at a leaf node: - 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. 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 : {{"auto", "sqrt", "log2"}}, int, float, 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 percentage and `int(max_features * n_features)` features are considered at each split. - If "auto", then `max_features=sqrt(n_features)`. - If "sqrt", then `max_features=sqrt(n_features)` (same as "auto"). - 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. max_leaf_nodes : int, default=None Grow trees 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. bootstrap : bool, default=True Whether bootstrap samples are used when building trees. .. versionchanged:: 0.13 The default of `bootstrap` will change from `True` to `False` in version 0.13. Bootstrapping is already taken care by the internal sampler using `replacement=True`. This implementation follows the algorithm proposed in [1]_. oob_score : bool, default=False Whether to use out-of-bag samples to estimate the generalization accuracy. sampling_strategy : float, str, dict, callable, default="auto" Sampling information to sample the data set. - When ``float``, it corresponds to the desired ratio of the number of samples in the minority class over the number of samples in the majority class after resampling. Therefore, the ratio is expressed as :math:`\alpha_{{us}} = N_{{m}} / N_{{rM}}` where :math:`N_{{m}}` is the number of samples in the minority class and :math:`N_{{rM}}` is the number of samples in the majority class after resampling. .. warning:: ``float`` is only available for **binary** classification. An error is raised for multi-class classification. - When ``str``, specify the class targeted by the resampling. The number of samples in the different classes will be equalized. Possible choices are: ``'majority'``: resample only the majority class; ``'not minority'``: resample all classes but the minority class; ``'not majority'``: resample all classes but the majority class; ``'all'``: resample all classes; ``'auto'``: equivalent to ``'not minority'``. - When ``dict``, the keys correspond to the targeted classes. The values correspond to the desired number of samples for each targeted class. - When callable, function taking ``y`` and returns a ``dict``. The keys correspond to the targeted classes. The values correspond to the desired number of samples for each class. .. versionchanged:: 0.11 The default of `sampling_strategy` will change from `"auto"` to `"all"` in version 0.13. This forces to use a bootstrap of the minority class as proposed in [1]_. replacement : bool, default=False Whether or not to sample randomly with replacement or not. .. versionchanged:: 0.11 The default of `replacement` will change from `False` to `True` in version 0.13. This forces to use a bootstrap of the minority class and draw with replacement as proposed in [1]_. {n_jobs} {random_state} verbose : int, default=0 Controls the verbosity of the tree building process. warm_start : bool, default=False When set to ``True``, reuse the solution of the previous call to fit and add more estimators to the ensemble, otherwise, just fit a whole new forest. class_weight : dict, list of dicts, {{"balanced", "balanced_subsample"}}, default=None Weights associated with classes in the form dictionary with the key being the class_label and the value the weight. If not given, 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))`` The "balanced_subsample" mode is the same as "balanced" except that weights are computed based on the bootstrap sample for every tree grown. 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. .. versionadded:: 0.6 Added in `scikit-learn` in 0.22 max_samples : int or float, default=None If bootstrap is True, the number of samples to draw from X to train each base estimator. - If None (default), then draw `X.shape[0]` samples. - If int, then draw `max_samples` samples. - If float, then draw `max_samples * X.shape[0]` samples. Thus, `max_samples` should be in the interval `(0, 1)`. Be aware that the final number samples used will be the minimum between the number of samples given in `max_samples` and the number of samples obtained after resampling. .. versionadded:: 0.6 Added in `scikit-learn` in 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. .. versionadded:: 0.12 Only supported when scikit-learn >= 1.4 is installed. Otherwise, a `ValueError` is raised. Attributes ---------- estimator_ : :class:`~sklearn.tree.DecisionTreeClassifier` instance The child estimator template used to create the collection of fitted sub-estimators. .. versionadded:: 0.10 estimators_ : list of :class:`~sklearn.tree.DecisionTreeClassifier` The collection of fitted sub-estimators. base_sampler_ : :class:`~imblearn.under_sampling.RandomUnderSampler` The base sampler used to construct the subsequent list of samplers. samplers_ : list of :class:`~imblearn.under_sampling.RandomUnderSampler` The collection of fitted samplers. pipelines_ : list of Pipeline. The collection of fitted pipelines (samplers + trees). classes_ : ndarray of shape (n_classes,) or a list of such arrays The classes labels (single output problem), or a list of arrays of class labels (multi-output problem). n_classes_ : int or list The number of classes (single output problem), or a list containing the number of classes for each output (multi-output problem). n_features_in_ : int Number of features in the input dataset. .. versionadded:: 0.9 feature_names_in_ : ndarray of shape (`n_features_in_`,) Names of features seen during `fit`. Defined only when `X` has feature names that are all strings. .. versionadded:: 0.9 n_outputs_ : int The number of outputs when ``fit`` is performed. feature_importances_ : ndarray of shape (n_features,) The feature importances (the higher, the more important the feature). oob_score_ : float Score of the training dataset obtained using an out-of-bag estimate. oob_decision_function_ : ndarray of shape (n_samples, n_classes) Decision function computed with out-of-bag estimate on the training set. If n_estimators is small it might be possible that a data point was never left out during the bootstrap. In this case, `oob_decision_function_` might contain NaN. See Also -------- BalancedBaggingClassifier : Bagging classifier for which each base estimator is trained on a balanced bootstrap. EasyEnsembleClassifier : Ensemble of AdaBoost classifier trained on balanced bootstraps. RUSBoostClassifier : AdaBoost classifier were each bootstrap is balanced using random-under sampling at each round of boosting. References ---------- .. [1] Chen, Chao, Andy Liaw, and Leo Breiman. "Using random forest to learn imbalanced data." University of California, Berkeley 110 (2004): 1-12. Examples -------- >>> from imblearn.ensemble import BalancedRandomForestClassifier >>> from sklearn.datasets import make_classification >>> >>> X, y = make_classification(n_samples=1000, n_classes=3, ... n_informative=4, weights=[0.2, 0.3, 0.5], ... random_state=0) >>> clf = BalancedRandomForestClassifier( ... sampling_strategy="all", replacement=True, max_depth=2, random_state=0, ... bootstrap=False) >>> clf.fit(X, y) BalancedRandomForestClassifier(...) >>> print(clf.feature_importances_) [...] >>> print(clf.predict([[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]])) [1] r2booleanrrr%right)closed> not majority not minorityallautomajority)r1sampling_strategy replacementdginiNrgsqrtFrJT) criterion max_depthmin_samples_splitmin_samples_leafmin_weight_fraction_leaf max_featuresmax_leaf_nodesmin_impurity_decreaser1 oob_scorerMrNrArBr. warm_startr/ ccp_alpha max_samples monotonic_cstc4id|d|d|d| d| d|d|d|d |d |d |d |d |d|d|d| d|d|i}ttdkr||d<n|td||_t jdi|| |_| |_dS)NrRrS n_estimatorsr1rZrArBr.r[r/rTrUrVrWrXrYr\r]r2r^zGMonotonic constraints are not supported for scikit-learn version < 1.4.r4)r"r ValueErrorr^super__init__rMrN)selfr`rRrSrTrUrVrWrXrYr1rZrMrNrArBr.r[r/r\r]r^params_random_forest __class__s r>rcz'BalancedRandomForestClassifier.__init__sf2    L      f   L  w  *  L  !2   0  '(@  L  n $%:! " # $ ;%  * mE22 2 24A  1 1( % "/D 00/000!2&r@c|jt|j|_nt||_t|j|j|_dS)zZCheck the estimator and the n_estimator attribute, set the `estimator_` attribute.N)rMrN) estimatorr estimator_r_sampling_strategyrN base_sampler_)rddefaults r>_validate_estimatorz2BalancedRandomForestClassifier._validate_estimatorsU > %#DN33DOO#GnnDO/"5(   r@ctj}|jdifdjDtj}| t ||t ||||fS)zMake and configure a copy of the `base_estimator_` attribute. Warning: This method should be used to properly instantiate new sub-estimators. c2i|]}|t|Sr4)getattr).0prds r> zJBalancedRandomForestClassifier._make_sampler_estimator..s%SSS74#3#3SSSr@Nr4)rri set_paramsestimator_paramsrkr )rdrBrhr9s` r>_make_sampler_estimatorz6BalancedRandomForestClassifier._make_sampler_estimators $/**  TTSSSST=RSSSTTT*++  # y, 7 7 7 w 5 5 5'!!r@)prefer_skip_nested_validationc z t|rtdtt dkrd}nd}t |ddt |\}tt dkrEtjj }| j j nd tjd _trt#j|}|jd kr(|jd d krt)d t*d |jd krt#j|d}|jd _|\}t3|dd t4ks |jjst#jt4t=jt@r:fdtCj|d"D_#n j_#| |zn|tIjdj%&j'sj(rtdtSj*}j+rtYdsg_-g_.g_/j0tcj-z }|dkr+tdj0tcj-fz|dkrt)dnjj+rFtcj-dkr.|2tftcj-gg} ti|D]E} 5|\} } 6| | 6| Ftoj8j9dfdtutw| D} tw| \} j-<j.<| j/<dtw| Dj(rtYd"r/jd kr$j?d_?j@d_@S)#aIBuild a forest of trees from the training set (X, y). Parameters ---------- X : {array-like, sparse matrix} of shape (n_samples, n_features) The training input samples. Internally, its dtype will be converted to ``dtype=np.float32``. If a sparse matrix is provided, it will be converted into a sparse ``csc_matrix``. y : array-like of shape (n_samples,) or (n_samples, n_outputs) The target values (class labels in classification, real numbers in regression). sample_weight : array-like of shape (n_samples,) 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. In the case of classification, splits are also ignored if they would result in any single class carrying a negative weight in either child node. Returns ------- self : object The fitted instance. z3sparse multilabel-indicator for y is not supported.r2FTcsc)r)r* multi_output accept_sparsedtypeensure_all_finite)rR)estimator_nameNr%rzA column-vector y was passed when a 1d array was expected. Please change the shape of y to (n_samples,), for example using ravel().) stacklevel)r%r|r|cvi|]5\}}tjjd|kdd|6S)r)npwhereclasses_)rqkeyvaluerds r>rsz6BalancedRandomForestClassifier.fit..jsO'''Cq)S011!4Q7'''r@zunder-samplingr) n_samplesr]z6Out of bag estimation only available if bootstrap=True estimators_zTn_estimators=%d must be larger or equal to len(estimators_)=%d when warm_start==TruezJWarm-start fitting without increasing n_estimators does not fit new trees.)size)rBthreads)rAr.preferc3K|]P\}\}}tt||j |t jj VQdS))r.r/r0r:r3N)rr?r1lenr.r/) rqistr)r3r0r+rdtrees y_encodeds r> z5BalancedRandomForestClassifier.fit..s Av15344N!JJ L!%!2(;3Qr@chg|]/\}}tt|t|0Sr4)rr)rqrrs r> z6BalancedRandomForestClassifier.fit..sB1"(1++x{{;;r@)zmulticlass-multioutputunknownz@The type of target cannot be used to compute OOB estimates. Got zv while only the following are supported: continuous, continuous-multioutput, binary, multiclass, multilabel-indicator.r)A_validate_paramsrrar"rr#DTYPEtyperhrR'_compute_missing_values_in_feature_maskrf__name__rr8 _n_features sort_indicesr atleast_1dndimrrreshape n_outputs__validate_y_class_weightrpDOUBLEflags contiguousascontiguousarray isinstancerMdictr$itemsrjr r]rmr1rZrrBr[hasattrr samplers_ pipelines_r`rrandintMAX_INTrangervappendrrAr. enumeratezipextendr_set_oob_score_and_attributes n_classes_r)rdr)r*r+r}rhexpanded_class_weightrBn_more_estimatorssamplers_r(r9samplers_treesy_typer3r0rrs`` ` @@@@r>fitz"BalancedRandomForestClassifier.fits6  A;; TRSS S mE22 2 2 %   $  /   1 mE22 2 2 -T^,,t~FFFIAAdn&=B + * .2 *  $0BBM71: A;;  NN    M!   6Q;;171:?? ?&     6Q;; 1g&&A'!*+/+H+H+K+K( ( 1gt $ $ . .ag6H .,YfEEEI d,d 3 3 =''''"9*$##%'' '''D # #'+&      """~ W$. WUVV V)$*;<<  !gdM&B&B !!D DN DO -D4D0E0EE q <$c$*:&;&;<=  ! # # !      J3t'7#8#81#<#<$$W3t7G3H3H$IIIEH,-- ) ) $ < <, < W W g T"""((((X{   "+3x+?+?!@!@! N,">2OHe   # #E * * * N ! !( + + + O " " #He 4 4    > =#A&&F>>> !8&,888  . .q) < < < 4 $ $ -A)=)="oa0DO M!,DM r@c||||_|jjddkr |jd|_ddlm}||t j|jd|_dS)aCompute and set the OOB score and attributes. Parameters ---------- X : array-like of shape (n_samples, n_features) The data matrix. y : ndarray of shape (n_samples, n_outputs) The target matrix. rr%)axisr)accuracy_scoreN) _compute_oob_predictionsoob_decision_function_r8squeezesklearn.metricsrrargmax oob_score_)rdr)r*rs r>rzrz7BalancedRandomForestClassifier._compute_oob_predictionss7" A;;  AGAJ O    774#>#> 7();YGNN (I6N8. CCCXy)4BHEEE "%dnd6F"G"G ( ( GY723J723J(.q1O":!1## !<&9L!! ..:&7&:;F-.?@G Wc\ " " "f , " " " wz " " "a ' " " " "y!! 5 5Aa$$&& 0% /0 :?+ S!V    38 4 4    r@c dddS)NF) multioutput multilabelr4)rds r> _more_tagsz)BalancedRandomForestClassifier._more_tagsFs$E:::r@ct}d|j_d|j_t tdk|j_ |S)NFr2) rb__sklearn_tags__ target_tagsrzclassifier_tags multi_labelr"r input_tags allow_nan)rdtagsrfs r>rz/BalancedRandomForestClassifier.__sklearn_tags__IsJww''))(-%+0($3}U7K7K$K! r@)rO)N)r __module__ __qualname____doc__r"rrr _parameter_constraintsr&updaterrrnumbersRealrcallablercrrmrvr!rrrrr __classcell__)rfs@r>rDrDYsA vvr --....!)*@*W!X!X!) ;" " !!#VVJJx,@,@%A%ABq!G<<< VVVWWzz6(++,, "&vvjj&.B.B'C'CD     ='!$!/='='='='='='='~+A*@*B*B      " " " "\555___65_B   (GGGR;;;r@rD)rNNNN)Drrcopyrwarningsrnumpyrrrrr scipy.sparser sklearn.baserr sklearn.ensembler sklearn.ensemble._baser sklearn.ensemble._forestr r rsklearn.exceptionsr sklearn.treer sklearn.utilsrrsklearn.utils._param_validationrrrsklearn.utils.fixesrsklearn.utils.multiclassrsklearn.utils.parallelrrsklearn.utils.validationrpipelinerunder_samplingrutilsrutils._docstringrr utils._sklearn_compatr!r"r#utils._validationr$_commonr&iinfoint32maxrr?rDr4r@r>rs?? """"""######!!!!!!--------333333555555 544444//////<<<<<<<<HHHHHHHHHH------33333344444444999999$$$$$$////// IIIIIIIIPPPPPPPPPP777777DDDDDD "(28     #',,,,^ (q q q q q %;q q  q q q r@