Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.Challenge: Comparing Models | Comparing Models
Classification with Python
course content

Course Content

Classification with Python

Classification with Python

1. k-NN Classifier
What is ClassificationWhat is k-NNk-NN with Multiple FeaturesImplementing k-NNMulti-Class ClassificationTrain-test Split. Cross ValidationChallenge: Choosing the Best K Value.k-NN Summary
2. Logistic Regression
What is Logistic RegressionFinding the ParametersChallenge: Implementing Logistic RegressionDecision BoundaryOverfitting. RegularizationChallenge: Classifying Unseparateble DataLogistic Regression Summary
3. Decision Tree
What is Decision TreeSplitting the NodesCrazy TreeChallenge: Implementing a Decision TreeDecision Tree Summary
4. Random Forest
What is Random ForestThe Randomness of ForestChallenge: Implementing a Random ForestRandom Forest Summary
5. Comparing Models
Confusion MatrixMetricsChallenge: Comparing ModelsSummary

bookChallenge: Comparing Models

Now we will compare the models we learned on one dataset. This is a breast cancer dataset. The target is the 'diagnosis' column (1 – malignant, 0 – benign).

We will apply GridSearchCV to each model to find the best parameters. Also, in this task, we would use the recall metric for scoring since we do not want to have False Negatives. GridSearchCV can choose the parameters based on the recall metric if you set scoring='recall'.

Task

The task is to build all the models we learned and to print the best parameters along with the best recall score of each model. You will need to fill in the parameter names in the param_grid dictionaries.

  1. For the k-NN model find the best n_neighbors value out of [3, 5, 7, 12].
  2. For the Logistic Regression run through [0.1, 1, 10] values of C.
  3. For a Decision Tree, we want to configure two parameters, max_depth and min_samples_leaf. Run through values [2, 4, 6, 10] for max_depth and [1, 2, 4, 7] for min_samples_leaf.
  4. For a Random Forest, find the best max_depth(maximum depth of each Tree) value out of [2, 4, 6] and the best number of trees(n_estimators). Try values [20, 50, 100] for the number of trees.

Note

The code takes some time to run(less than a minute).

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Section 5. Chapter 3
toggle bottom row

bookChallenge: Comparing Models

Now we will compare the models we learned on one dataset. This is a breast cancer dataset. The target is the 'diagnosis' column (1 – malignant, 0 – benign).

We will apply GridSearchCV to each model to find the best parameters. Also, in this task, we would use the recall metric for scoring since we do not want to have False Negatives. GridSearchCV can choose the parameters based on the recall metric if you set scoring='recall'.

Task

The task is to build all the models we learned and to print the best parameters along with the best recall score of each model. You will need to fill in the parameter names in the param_grid dictionaries.

  1. For the k-NN model find the best n_neighbors value out of [3, 5, 7, 12].
  2. For the Logistic Regression run through [0.1, 1, 10] values of C.
  3. For a Decision Tree, we want to configure two parameters, max_depth and min_samples_leaf. Run through values [2, 4, 6, 10] for max_depth and [1, 2, 4, 7] for min_samples_leaf.
  4. For a Random Forest, find the best max_depth(maximum depth of each Tree) value out of [2, 4, 6] and the best number of trees(n_estimators). Try values [20, 50, 100] for the number of trees.

Note

The code takes some time to run(less than a minute).

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Section 5. Chapter 3
toggle bottom row

bookChallenge: Comparing Models

Now we will compare the models we learned on one dataset. This is a breast cancer dataset. The target is the 'diagnosis' column (1 – malignant, 0 – benign).

We will apply GridSearchCV to each model to find the best parameters. Also, in this task, we would use the recall metric for scoring since we do not want to have False Negatives. GridSearchCV can choose the parameters based on the recall metric if you set scoring='recall'.

Task

The task is to build all the models we learned and to print the best parameters along with the best recall score of each model. You will need to fill in the parameter names in the param_grid dictionaries.

  1. For the k-NN model find the best n_neighbors value out of [3, 5, 7, 12].
  2. For the Logistic Regression run through [0.1, 1, 10] values of C.
  3. For a Decision Tree, we want to configure two parameters, max_depth and min_samples_leaf. Run through values [2, 4, 6, 10] for max_depth and [1, 2, 4, 7] for min_samples_leaf.
  4. For a Random Forest, find the best max_depth(maximum depth of each Tree) value out of [2, 4, 6] and the best number of trees(n_estimators). Try values [20, 50, 100] for the number of trees.

Note

The code takes some time to run(less than a minute).

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Now we will compare the models we learned on one dataset. This is a breast cancer dataset. The target is the 'diagnosis' column (1 – malignant, 0 – benign).

We will apply GridSearchCV to each model to find the best parameters. Also, in this task, we would use the recall metric for scoring since we do not want to have False Negatives. GridSearchCV can choose the parameters based on the recall metric if you set scoring='recall'.

Task

The task is to build all the models we learned and to print the best parameters along with the best recall score of each model. You will need to fill in the parameter names in the param_grid dictionaries.

  1. For the k-NN model find the best n_neighbors value out of [3, 5, 7, 12].
  2. For the Logistic Regression run through [0.1, 1, 10] values of C.
  3. For a Decision Tree, we want to configure two parameters, max_depth and min_samples_leaf. Run through values [2, 4, 6, 10] for max_depth and [1, 2, 4, 7] for min_samples_leaf.
  4. For a Random Forest, find the best max_depth(maximum depth of each Tree) value out of [2, 4, 6] and the best number of trees(n_estimators). Try values [20, 50, 100] for the number of trees.

Note

The code takes some time to run(less than a minute).

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Section 5. Chapter 3
Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
some-alt