Flow
TEST844a3c4730sklearn.ensemble.weight_boosting.AdaBoostClassifier(base_estimator=sklearn.tree.tree.DecisionTreeClassifier)

TEST844a3c4730sklearn.ensemble.weight_boosting.AdaBoostClassifier(base_estimator=sklearn.tree.tree.DecisionTreeClassifier)

Visibility: public Uploaded 10-01-2024 by Continuous Integration sklearn==0.21.2 numpy>=1.11.0 scipy>=0.17.0 joblib>=0.11 0 runs
0 likes downloaded by 0 people 0 issues 0 downvotes , 0 total downloads
  • openml-python python scikit-learn sklearn sklearn_0.21.2
Issue #Downvotes for this reason By


Loading wiki
Help us complete this description Edit
An AdaBoost classifier. An AdaBoost [1] classifier is a meta-estimator that begins by fitting a classifier on the original dataset and then fits additional copies of the classifier on the same dataset but where the weights of incorrectly classified instances are adjusted such that subsequent classifiers focus more on difficult cases. This class implements the algorithm known as AdaBoost-SAMME [2].

Components

base_estimatorTEST844a3c4730sklearn.tree.tree.DecisionTreeClassifier(1)The base estimator from which the boosted ensemble is built Support for sample weighting is required, as well as proper ``classes_`` and ``n_classes_`` attributes. If ``None``, then the base estimator is ``DecisionTreeClassifier(max_depth=1)``

Parameters

algorithmdefault: "SAMME.R"
base_estimatorThe base estimator from which the boosted ensemble is built Support for sample weighting is required, as well as proper ``classes_`` and ``n_classes_`` attributes. If ``None``, then the base estimator is ``DecisionTreeClassifier(max_depth=1)``default: {"oml-python:serialized_object": "component_reference", "value": {"key": "base_estimator", "step_name": null}}
learning_rateLearning rate shrinks the contribution of each classifier by ``learning_rate``. There is a trade-off between ``learning_rate`` and ``n_estimators`` algorithm : {'SAMME', 'SAMME.R'}, optional (default='SAMME.R') If 'SAMME.R' then use the SAMME.R real boosting algorithm ``base_estimator`` must support calculation of class probabilities If 'SAMME' then use the SAMME discrete boosting algorithm The SAMME.R algorithm typically converges faster than SAMME, achieving a lower test error with fewer boosting iterationsdefault: 1.0
n_estimatorsThe maximum number of estimators at which boosting is terminated In case of perfect fit, the learning procedure is stopped earlydefault: 50
random_stateIf int, random_state is the seed used by the random number generator; If RandomState instance, random_state is the random number generator; If None, the random number generator is the RandomState instance used by `np.random`.default: null

0
Runs

List all runs
Parameter:
Rendering chart
Rendering table