What is EvalML?¶
EvalML is an AutoML library that builds, optimizes, and evaluates machine learning pipelines using domain-specific objective functions.
Combined with Featuretools and Compose, EvalML can be used to create end-to-end machine learning solutions for classification and regression problems.
Quick Start¶
[1]:
import evalml
from evalml import AutoClassificationSearch
Load Data¶
First, we load in the features and outcomes we want to use to train our model
[2]:
X, y = evalml.demos.load_breast_cancer()
Configure search¶
EvalML has many options to configure the pipeline search. At the minimum, we need to define an objective function. For simplicity, we will use the F1 score in this example. However, the real power of EvalML is in using domain-specific objective functions or building your own.
Below EvalML utilizes Bayesian optimization (EvalML’s default optimizer) to search and find the best pipeline defined by the given objective.
[3]:
automl = AutoClassificationSearch(objective="f1",
max_pipelines=5)
In order to validate the results of the pipeline creation and optimization process, we will save some of our data as a holdout set.
[4]:
X_train, X_holdout, y_train, y_holdout = evalml.preprocessing.split_data(X, y, test_size=.2)
When we call .search(), the search for the best pipeline will begin. There is no need to wrangle with missing data or categorical variables as EvalML includes various preprocessing steps (like imputation, one-hot encoding, feature selection) to ensure you’re getting the best results. As long as your data is in a single table, EvalML can handle it. If not, you can reduce your data to a single table by utilizing Featuretools and its Entity Sets.
You can find more information on pipeline components and how to integrate your own custom pipelines into EvalML here.
[5]:
automl.search(X_train, y_train)
*****************************
* Beginning pipeline search *
*****************************
Optimizing for F1.
Greater score is better.
Searching up to 5 pipelines.
Allowed model families: catboost, linear_model, random_forest, xgboost
✔ Mode Baseline Binary Classification... 0%| | Elapsed:00:00
✔ Cat Boost Binary Classification Pip... 20%|██ | Elapsed:00:20
✔ Logistic Regression Binary Pipeline: 40%|████ | Elapsed:00:21
✔ Random Forest Binary Classification... 60%|██████ | Elapsed:00:23
✔ XGBoost Binary Classification Pipel... 80%|████████ | Elapsed:00:24
✔ Optimization finished 80%|████████ | Elapsed:00:24
See Pipeline Rankings¶
After the search is finished we can view all of the pipelines searched, ranked by score. Internally, EvalML performs cross validation to score the pipelines. If it notices a high variance across cross validation folds, it will warn you. EvalML also provides additional data checks to analyze your data to assist you in producing the best performing pipeline.
[6]:
automl.rankings
[6]:
| id | pipeline_name | score | high_variance_cv | parameters | |
|---|---|---|---|---|---|
| 0 | 2 | Logistic Regression Binary Pipeline | 0.977491 | False | {'One Hot Encoder': {'top_n': 10}, 'Simple Imp... |
| 1 | 3 | Random Forest Binary Classification Pipeline | 0.967238 | False | {'One Hot Encoder': {'top_n': 10}, 'Simple Imp... |
| 2 | 1 | Cat Boost Binary Classification Pipeline | 0.965879 | False | {'Simple Imputer': {'impute_strategy': 'most_f... |
| 3 | 4 | XGBoost Binary Classification Pipeline | 0.965349 | False | {'One Hot Encoder': {'top_n': 10}, 'Simple Imp... |
| 4 | 0 | Mode Baseline Binary Classification Pipeline | 0.770273 | False | {'strategy': 'random_weighted'} |
Describe pipeline¶
If we are interested in see more details about the pipeline, we can describe it using the id from the rankings table:
[7]:
automl.describe_pipeline(3)
************************************************
* Random Forest Binary Classification Pipeline *
************************************************
Problem Type: Binary Classification
Model Family: Random Forest
Number of features: 30
Pipeline Steps
==============
1. One Hot Encoder
* top_n : 10
2. Simple Imputer
* impute_strategy : most_frequent
* fill_value : None
3. Random Forest Classifier
* n_estimators : 100
* max_depth : 6
Training
========
Training for Binary Classification problems.
Total training time (including CV): 1.8 seconds
Cross Validation
----------------
F1 Accuracy Binary Balanced Accuracy Binary Precision AUC Log Loss Binary MCC Binary # Training # Testing
0 0.974 0.967 0.960 0.959 0.987 0.127 0.930 303.000 152.000
1 0.979 0.974 0.968 0.969 0.995 0.105 0.944 303.000 152.000
2 0.948 0.934 0.922 0.929 0.975 0.193 0.857 304.000 151.000
mean 0.967 0.958 0.950 0.953 0.986 0.142 0.910 - -
std 0.016 0.021 0.025 0.021 0.010 0.046 0.046 - -
coef of var 0.017 0.022 0.026 0.022 0.010 0.322 0.051 - -
Select Best pipeline¶
We can now select best pipeline and score it on our holdout data:
[8]:
pipeline = automl.best_pipeline
pipeline.score(X_holdout, y_holdout, ["f1"])
[8]:
OrderedDict([('F1', 0.9795918367346939)])
We can also visualize the structure of our pipeline:
[9]:
pipeline.graph()
[9]:
