Train je eerste classificatieboom

In deze oefening werk je met de Wisconsin Breast Cancer Dataset uit de UCI machine learning-repository. Je voorspelt of een tumor kwaadaardig of goedaardig is op basis van twee features: de gemiddelde straal van de tumor (radius_mean) en het gemiddelde aantal concave punten (concave points_mean).

De gegevensset is al in je werkruimte geladen en is opgesplitst in 80% train en 20% test. De feature-matrices zijn toegewezen aan X_train en X_test, terwijl de label-arrays zijn toegewezen aan y_train en y_test, waarbij klasse 1 overeenkomt met een kwaadaardige tumor en klasse 0 met een goedaardige tumor. Om reproduceerbare resultaten te krijgen, is ook een variabele SEED gedefinieerd met waarde 1.

Deze oefening maakt deel uit van de cursus

Machine Learning met boomgebaseerde modellen in Python

Cursus bekijken

Oefeninstructies

Importeer DecisionTreeClassifier uit sklearn.tree.
Instantiseer een DecisionTreeClassifier dt met een maximale diepte van 6.
Fit dt op de trainingsset.
Voorspel de testlabels en wijs het resultaat toe aan y_pred.

Praktische interactieve oefening

Probeer deze oefening eens door deze voorbeeldcode in te vullen.

# Import DecisionTreeClassifier from sklearn.tree
from ____.____ import ____

# Instantiate a DecisionTreeClassifier 'dt' with a maximum depth of 6
dt = ____(____=____, random_state=SEED)

# Fit dt to the training set
____.____(____, ____)

# Predict test set labels
y_pred = ____.____(____)
print(y_pred[0:5])

Code bewerken en uitvoeren

Deze oefening maakt deel uit van de cursus

Machine Learning met boomgebaseerde modellen in Python

SkillTag.level.intermediateSkillTag.label

4.9+

Begin de cursus gratis

Classification and Regression Trees (CART) are a set of supervised learning models used for problems involving classification and regression. In this chapter, you'll be introduced to the CART algorithm.

Exercise 1: Beslissingsboom voor classificatie Exercise 2: Train je eerste classificatieboom

Huidige oefening

Exercise 3: Evalueer de classificatieboom Exercise 4: Logistische regressie vs. classificatieboom Exercise 5: Classification tree leren Exercise 6: Een classificatieboom laten groeien Exercise 7: Entropie als criterium gebruiken Exercise 8: Entropie vs. Gini-index Exercise 9: Beslissingsboom voor regressie Exercise 10: Train je eerste regressieboom Exercise 11: Evalueer de regressieboom Exercise 12: Lineaire regressie vs regressieboom

The bias-variance tradeoff is one of the fundamental concepts in supervised machine learning. In this chapter, you'll understand how to diagnose the problems of overfitting and underfitting. You'll also be introduced to the concept of ensembling where the predictions of several models are aggregated to produce predictions that are more robust.

Exercise 1: Generalization Error Exercise 2: Complexity, bias and variance Exercise 3: Overfitting and underfitting Exercise 4: Diagnose bias and variance problems Exercise 5: Instantiate the model Exercise 6: Evaluate the 10-fold CV error Exercise 7: Evaluate the training error Exercise 8: High bias or high variance?Exercise 9: Ensemble Learning Exercise 10: Define the ensemble Exercise 11: Evaluate individual classifiers Exercise 12: Better performance with a Voting Classifier

Bagging is an ensemble method involving training the same algorithm many times using different subsets sampled from the training data. In this chapter, you'll understand how bagging can be used to create a tree ensemble. You'll also learn how the random forests algorithm can lead to further ensemble diversity through randomization at the level of each split in the trees forming the ensemble.

Exercise 1: Bagging Exercise 2: Define the bagging classifier Exercise 3: Evaluate Bagging performance Exercise 4: Out of Bag Evaluation Exercise 5: Prepare the ground Exercise 6: OOB Score vs Test Set Score Exercise 7: Random Forests (RF)Exercise 8: Train an RF regressor Exercise 9: Evaluate the RF regressor Exercise 10: Visualizing features importances

Boosting refers to an ensemble method in which several models are trained sequentially with each model learning from the errors of its predecessors. In this chapter, you'll be introduced to the two boosting methods of AdaBoost and Gradient Boosting.

Exercise 1: Adaboost Exercise 2: Define the AdaBoost classifier Exercise 3: Train the AdaBoost classifier Exercise 4: Evaluate the AdaBoost classifier Exercise 5: Gradient Boosting (GB)Exercise 6: Define the GB regressor Exercise 7: Train the GB regressor Exercise 8: Evaluate the GB regressor Exercise 9: Stochastic Gradient Boosting (SGB)Exercise 10: Regression with SGB Exercise 11: Train the SGB regressor Exercise 12: Evaluate the SGB regressor

The hyperparameters of a machine learning model are parameters that are not learned from data. They should be set prior to fitting the model to the training set. In this chapter, you'll learn how to tune the hyperparameters of a tree-based model using grid search cross validation.

Exercise 1: Tuning a CART's Hyperparameters Exercise 2: Tree hyperparameters Exercise 3: Set the tree's hyperparameter grid Exercise 4: Search for the optimal tree Exercise 5: Evaluate the optimal tree Exercise 6: Tuning a RF's Hyperparameters Exercise 7: Random forests hyperparameters Exercise 8: Set the hyperparameter grid of RF Exercise 9: Search for the optimal forest Exercise 10: Evaluate the optimal forest Exercise 11: Congratulations!