Support Vector Machines

Import Libraries


In [1]:
import pandas as pd
import numpy as np
import matplotlib.pyplot as plt
import seaborn as sns
%matplotlib inline

Get the Data

Using the built-in breast-cancer dataset of sklearn


In [2]:
from sklearn.datasets import load_breast_cancer

In [3]:
cancer = load_breast_cancer()

The data set is presented in a dictionary form:


In [4]:
cancer.keys()


Out[4]:
['target_names', 'data', 'target', 'DESCR', 'feature_names']

We can grab information and arrays out of this dictionary to set up our data frame and understanding of the features:


In [5]:
print(cancer['DESCR'])


Breast Cancer Wisconsin (Diagnostic) Database
=============================================

Notes
-----
Data Set Characteristics:
    :Number of Instances: 569

    :Number of Attributes: 30 numeric, predictive attributes and the class

    :Attribute Information:
        - radius (mean of distances from center to points on the perimeter)
        - texture (standard deviation of gray-scale values)
        - perimeter
        - area
        - smoothness (local variation in radius lengths)
        - compactness (perimeter^2 / area - 1.0)
        - concavity (severity of concave portions of the contour)
        - concave points (number of concave portions of the contour)
        - symmetry 
        - fractal dimension ("coastline approximation" - 1)

        The mean, standard error, and "worst" or largest (mean of the three
        largest values) of these features were computed for each image,
        resulting in 30 features.  For instance, field 3 is Mean Radius, field
        13 is Radius SE, field 23 is Worst Radius.

        - class:
                - WDBC-Malignant
                - WDBC-Benign

    :Summary Statistics:

    ===================================== ====== ======
                                           Min    Max
    ===================================== ====== ======
    radius (mean):                        6.981  28.11
    texture (mean):                       9.71   39.28
    perimeter (mean):                     43.79  188.5
    area (mean):                          143.5  2501.0
    smoothness (mean):                    0.053  0.163
    compactness (mean):                   0.019  0.345
    concavity (mean):                     0.0    0.427
    concave points (mean):                0.0    0.201
    symmetry (mean):                      0.106  0.304
    fractal dimension (mean):             0.05   0.097
    radius (standard error):              0.112  2.873
    texture (standard error):             0.36   4.885
    perimeter (standard error):           0.757  21.98
    area (standard error):                6.802  542.2
    smoothness (standard error):          0.002  0.031
    compactness (standard error):         0.002  0.135
    concavity (standard error):           0.0    0.396
    concave points (standard error):      0.0    0.053
    symmetry (standard error):            0.008  0.079
    fractal dimension (standard error):   0.001  0.03
    radius (worst):                       7.93   36.04
    texture (worst):                      12.02  49.54
    perimeter (worst):                    50.41  251.2
    area (worst):                         185.2  4254.0
    smoothness (worst):                   0.071  0.223
    compactness (worst):                  0.027  1.058
    concavity (worst):                    0.0    1.252
    concave points (worst):               0.0    0.291
    symmetry (worst):                     0.156  0.664
    fractal dimension (worst):            0.055  0.208
    ===================================== ====== ======

    :Missing Attribute Values: None

    :Class Distribution: 212 - Malignant, 357 - Benign

    :Creator:  Dr. William H. Wolberg, W. Nick Street, Olvi L. Mangasarian

    :Donor: Nick Street

    :Date: November, 1995

This is a copy of UCI ML Breast Cancer Wisconsin (Diagnostic) datasets.
https://goo.gl/U2Uwz2

Features are computed from a digitized image of a fine needle
aspirate (FNA) of a breast mass.  They describe
characteristics of the cell nuclei present in the image.

Separating plane described above was obtained using
Multisurface Method-Tree (MSM-T) [K. P. Bennett, "Decision Tree
Construction Via Linear Programming." Proceedings of the 4th
Midwest Artificial Intelligence and Cognitive Science Society,
pp. 97-101, 1992], a classification method which uses linear
programming to construct a decision tree.  Relevant features
were selected using an exhaustive search in the space of 1-4
features and 1-3 separating planes.

The actual linear program used to obtain the separating plane
in the 3-dimensional space is that described in:
[K. P. Bennett and O. L. Mangasarian: "Robust Linear
Programming Discrimination of Two Linearly Inseparable Sets",
Optimization Methods and Software 1, 1992, 23-34].

This database is also available through the UW CS ftp server:

ftp ftp.cs.wisc.edu
cd math-prog/cpo-dataset/machine-learn/WDBC/

References
----------
   - W.N. Street, W.H. Wolberg and O.L. Mangasarian. Nuclear feature extraction 
     for breast tumor diagnosis. IS&T/SPIE 1993 International Symposium on 
     Electronic Imaging: Science and Technology, volume 1905, pages 861-870,
     San Jose, CA, 1993.
   - O.L. Mangasarian, W.N. Street and W.H. Wolberg. Breast cancer diagnosis and 
     prognosis via linear programming. Operations Research, 43(4), pages 570-577, 
     July-August 1995.
   - W.H. Wolberg, W.N. Street, and O.L. Mangasarian. Machine learning techniques
     to diagnose breast cancer from fine-needle aspirates. Cancer Letters 77 (1994) 
     163-171.


In [6]:
cancer['feature_names']


Out[6]:
array(['mean radius', 'mean texture', 'mean perimeter', 'mean area',
       'mean smoothness', 'mean compactness', 'mean concavity',
       'mean concave points', 'mean symmetry', 'mean fractal dimension',
       'radius error', 'texture error', 'perimeter error', 'area error',
       'smoothness error', 'compactness error', 'concavity error',
       'concave points error', 'symmetry error', 'fractal dimension error',
       'worst radius', 'worst texture', 'worst perimeter', 'worst area',
       'worst smoothness', 'worst compactness', 'worst concavity',
       'worst concave points', 'worst symmetry', 'worst fractal dimension'], 
      dtype='|S23')

Set up DataFrame


In [7]:
df_feat = pd.DataFrame(cancer['data'],columns=cancer['feature_names'])
df_feat.info()


<class 'pandas.core.frame.DataFrame'>
RangeIndex: 569 entries, 0 to 568
Data columns (total 30 columns):
mean radius                569 non-null float64
mean texture               569 non-null float64
mean perimeter             569 non-null float64
mean area                  569 non-null float64
mean smoothness            569 non-null float64
mean compactness           569 non-null float64
mean concavity             569 non-null float64
mean concave points        569 non-null float64
mean symmetry              569 non-null float64
mean fractal dimension     569 non-null float64
radius error               569 non-null float64
texture error              569 non-null float64
perimeter error            569 non-null float64
area error                 569 non-null float64
smoothness error           569 non-null float64
compactness error          569 non-null float64
concavity error            569 non-null float64
concave points error       569 non-null float64
symmetry error             569 non-null float64
fractal dimension error    569 non-null float64
worst radius               569 non-null float64
worst texture              569 non-null float64
worst perimeter            569 non-null float64
worst area                 569 non-null float64
worst smoothness           569 non-null float64
worst compactness          569 non-null float64
worst concavity            569 non-null float64
worst concave points       569 non-null float64
worst symmetry             569 non-null float64
worst fractal dimension    569 non-null float64
dtypes: float64(30)
memory usage: 133.4 KB

In [8]:
cancer['target']


Out[8]:
array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0,
       0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0,
       1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1,
       1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0,
       1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1,
       1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1,
       0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1,
       0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1,
       0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1,
       0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0,
       0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0,
       0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1,
       1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1,
       1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0,
       1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1,
       1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1,
       0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1,
       1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1,
       0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1,
       1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1,
       0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1,
       1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1,
       1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1,
       1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
       1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1])

In [9]:
df_target = pd.DataFrame(cancer['target'],columns=['Cancer'])

In [29]:
df_target.head()


Out[29]:
Cancer
0 0
1 0
2 0
3 0
4 0

Train Test Split


In [11]:
from sklearn.model_selection import train_test_split

In [12]:
X_train, X_test, y_train, y_test = train_test_split(df_feat, np.ravel(df_target), test_size=0.30, random_state=101)

Train the Support Vector Classifier


In [13]:
from sklearn.svm import SVC

In [14]:
model = SVC()

In [15]:
model.fit(X_train,y_train)


Out[15]:
SVC(C=1.0, cache_size=200, class_weight=None, coef0=0.0,
  decision_function_shape=None, degree=3, gamma='auto', kernel='rbf',
  max_iter=-1, probability=False, random_state=None, shrinking=True,
  tol=0.001, verbose=False)

Predictions and Evaluations


In [16]:
predictions = model.predict(X_test)

In [17]:
from sklearn.metrics import classification_report,confusion_matrix

In [18]:
print(confusion_matrix(y_test,predictions))


[[  0  66]
 [  0 105]]

In [19]:
print(classification_report(y_test,predictions))


             precision    recall  f1-score   support

          0       0.00      0.00      0.00        66
          1       0.61      1.00      0.76       105

avg / total       0.38      0.61      0.47       171

/usr/local/lib/python2.7/dist-packages/sklearn/metrics/classification.py:1113: UndefinedMetricWarning: Precision and F-score are ill-defined and being set to 0.0 in labels with no predicted samples.
  'precision', 'predicted', average, warn_for)

Notice that we are classifying everything into a single class! This means our model needs to have it parameters adjusted (it may also help to normalize the data).

Gridsearch

Finding the right parameters (like what C or gamma values to use) is a tricky task! This idea of creating a 'grid' of parameters and just trying out all the possible combinations is called a Gridsearch, this method is common enough that Scikit-learn has this functionality built in with GridSearchCV! The CV stands for cross-validation which is the GridSearchCV takes a dictionary that describes the parameters that should be tried and a model to train. The grid of parameters is defined as a dictionary, where the keys are the parameters and the values are the settings to be tested.


In [20]:
param_grid = {'C': [0.1,1, 10, 100, 1000], 'gamma': [1,0.1,0.01,0.001,0.0001], 'kernel': ['rbf']}

In [21]:
from sklearn.model_selection import GridSearchCV

In [22]:
grid = GridSearchCV(SVC(),param_grid,refit=True,verbose=3)

What fit does is a bit more involved then usual. First, it runs the same loop with cross-validation, to find the best parameter combination. Once it has the best combination, it runs fit again on all data passed to fit (without cross-validation), to built a single new model using the best parameter setting.


In [23]:
# May take awhile!
grid.fit(X_train,y_train)


Fitting 3 folds for each of 25 candidates, totalling 75 fits
[CV] kernel=rbf, C=0.1, gamma=1 ......................................
[CV] ....... kernel=rbf, C=0.1, gamma=1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=1 ......................................
[CV] ....... kernel=rbf, C=0.1, gamma=1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=1 ......................................
[CV] ....... kernel=rbf, C=0.1, gamma=1, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=0.1 ....................................
[CV] ..... kernel=rbf, C=0.1, gamma=0.1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=0.1 ....................................
[CV] ..... kernel=rbf, C=0.1, gamma=0.1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=0.1 ....................................
[CV] ..... kernel=rbf, C=0.1, gamma=0.1, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=0.01 ...................................
[CV] .... kernel=rbf, C=0.1, gamma=0.01, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=0.01 ...................................
[CV] .... kernel=rbf, C=0.1, gamma=0.01, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=0.01 ...................................
[CV] .... kernel=rbf, C=0.1, gamma=0.01, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=0.001 ..................................
[CV] ... kernel=rbf, C=0.1, gamma=0.001, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=0.001 ..................................
[CV] ... kernel=rbf, C=0.1, gamma=0.001, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=0.001 ..................................
[Parallel(n_jobs=1)]: Done   1 out of   1 | elapsed:    0.0s remaining:    0.0s
[Parallel(n_jobs=1)]: Done   2 out of   2 | elapsed:    0.0s remaining:    0.0s
[CV] ... kernel=rbf, C=0.1, gamma=0.001, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=0.0001 .................................
[CV] .. kernel=rbf, C=0.1, gamma=0.0001, score=0.902256, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=0.0001 .................................
[CV] .. kernel=rbf, C=0.1, gamma=0.0001, score=0.962406, total=   0.0s
[CV] kernel=rbf, C=0.1, gamma=0.0001 .................................
[CV] .. kernel=rbf, C=0.1, gamma=0.0001, score=0.916667, total=   0.0s
[CV] kernel=rbf, C=1, gamma=1 ........................................
[CV] ......... kernel=rbf, C=1, gamma=1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=1, gamma=1 ........................................
[CV] ......... kernel=rbf, C=1, gamma=1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=1, gamma=1 ........................................
[CV] ......... kernel=rbf, C=1, gamma=1, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=1, gamma=0.1 ......................................
[CV] ....... kernel=rbf, C=1, gamma=0.1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=1, gamma=0.1 ......................................
[CV] ....... kernel=rbf, C=1, gamma=0.1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=1, gamma=0.1 ......................................
[CV] ....... kernel=rbf, C=1, gamma=0.1, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=1, gamma=0.01 .....................................
[CV] ...... kernel=rbf, C=1, gamma=0.01, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=1, gamma=0.01 .....................................
[CV] ...... kernel=rbf, C=1, gamma=0.01, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=1, gamma=0.01 .....................................
[CV] ...... kernel=rbf, C=1, gamma=0.01, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=1, gamma=0.001 ....................................
[CV] ..... kernel=rbf, C=1, gamma=0.001, score=0.902256, total=   0.0s
[CV] kernel=rbf, C=1, gamma=0.001 ....................................
[CV] ..... kernel=rbf, C=1, gamma=0.001, score=0.939850, total=   0.0s
[CV] kernel=rbf, C=1, gamma=0.001 ....................................
[CV] ..... kernel=rbf, C=1, gamma=0.001, score=0.954545, total=   0.0s
[CV] kernel=rbf, C=1, gamma=0.0001 ...................................
[CV] .... kernel=rbf, C=1, gamma=0.0001, score=0.939850, total=   0.0s
[CV] kernel=rbf, C=1, gamma=0.0001 ...................................
[CV] .... kernel=rbf, C=1, gamma=0.0001, score=0.969925, total=   0.0s
[CV] kernel=rbf, C=1, gamma=0.0001 ...................................
[CV] .... kernel=rbf, C=1, gamma=0.0001, score=0.946970, total=   0.0s
[CV] kernel=rbf, C=10, gamma=1 .......................................
[CV] ........ kernel=rbf, C=10, gamma=1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=10, gamma=1 .......................................
[CV] ........ kernel=rbf, C=10, gamma=1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=10, gamma=1 .......................................
[CV] ........ kernel=rbf, C=10, gamma=1, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=10, gamma=0.1 .....................................
[CV] ...... kernel=rbf, C=10, gamma=0.1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=10, gamma=0.1 .....................................
[CV] ...... kernel=rbf, C=10, gamma=0.1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=10, gamma=0.1 .....................................
[CV] ...... kernel=rbf, C=10, gamma=0.1, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=10, gamma=0.01 ....................................
[CV] ..... kernel=rbf, C=10, gamma=0.01, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=10, gamma=0.01 ....................................
[CV] ..... kernel=rbf, C=10, gamma=0.01, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=10, gamma=0.01 ....................................
[CV] ..... kernel=rbf, C=10, gamma=0.01, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=10, gamma=0.001 ...................................
[CV] .... kernel=rbf, C=10, gamma=0.001, score=0.894737, total=   0.0s
[CV] kernel=rbf, C=10, gamma=0.001 ...................................
[CV] .... kernel=rbf, C=10, gamma=0.001, score=0.932331, total=   0.0s
[CV] kernel=rbf, C=10, gamma=0.001 ...................................
[CV] .... kernel=rbf, C=10, gamma=0.001, score=0.916667, total=   0.0s
[CV] kernel=rbf, C=10, gamma=0.0001 ..................................
[CV] ... kernel=rbf, C=10, gamma=0.0001, score=0.932331, total=   0.0s
[CV] kernel=rbf, C=10, gamma=0.0001 ..................................
[CV] ... kernel=rbf, C=10, gamma=0.0001, score=0.969925, total=   0.0s
[CV] kernel=rbf, C=10, gamma=0.0001 ..................................
[CV] ... kernel=rbf, C=10, gamma=0.0001, score=0.962121, total=   0.0s
[CV] kernel=rbf, C=100, gamma=1 ......................................
[CV] ....... kernel=rbf, C=100, gamma=1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=100, gamma=1 ......................................
[CV] ....... kernel=rbf, C=100, gamma=1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=100, gamma=1 ......................................
[CV] ....... kernel=rbf, C=100, gamma=1, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=100, gamma=0.1 ....................................
[CV] ..... kernel=rbf, C=100, gamma=0.1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=100, gamma=0.1 ....................................
[CV] ..... kernel=rbf, C=100, gamma=0.1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=100, gamma=0.1 ....................................
[CV] ..... kernel=rbf, C=100, gamma=0.1, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=100, gamma=0.01 ...................................
[CV] .... kernel=rbf, C=100, gamma=0.01, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=100, gamma=0.01 ...................................
[CV] .... kernel=rbf, C=100, gamma=0.01, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=100, gamma=0.01 ...................................
[CV] .... kernel=rbf, C=100, gamma=0.01, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=100, gamma=0.001 ..................................
[CV] ... kernel=rbf, C=100, gamma=0.001, score=0.894737, total=   0.0s
[CV] kernel=rbf, C=100, gamma=0.001 ..................................
[CV] ... kernel=rbf, C=100, gamma=0.001, score=0.932331, total=   0.0s
[CV] kernel=rbf, C=100, gamma=0.001 ..................................
[CV] ... kernel=rbf, C=100, gamma=0.001, score=0.916667, total=   0.0s
[CV] kernel=rbf, C=100, gamma=0.0001 .................................
[CV] .. kernel=rbf, C=100, gamma=0.0001, score=0.917293, total=   0.0s
[CV] kernel=rbf, C=100, gamma=0.0001 .................................
[CV] .. kernel=rbf, C=100, gamma=0.0001, score=0.977444, total=   0.0s
[CV] kernel=rbf, C=100, gamma=0.0001 .................................
[CV] .. kernel=rbf, C=100, gamma=0.0001, score=0.939394, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=1 .....................................
[CV] ...... kernel=rbf, C=1000, gamma=1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=1 .....................................
[CV] ...... kernel=rbf, C=1000, gamma=1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=1 .....................................
[CV] ...... kernel=rbf, C=1000, gamma=1, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=0.1 ...................................
[CV] .... kernel=rbf, C=1000, gamma=0.1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=0.1 ...................................
[CV] .... kernel=rbf, C=1000, gamma=0.1, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=0.1 ...................................
[CV] .... kernel=rbf, C=1000, gamma=0.1, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=0.01 ..................................
[CV] ... kernel=rbf, C=1000, gamma=0.01, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=0.01 ..................................
[CV] ... kernel=rbf, C=1000, gamma=0.01, score=0.631579, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=0.01 ..................................
[CV] ... kernel=rbf, C=1000, gamma=0.01, score=0.636364, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=0.001 .................................
[CV] .. kernel=rbf, C=1000, gamma=0.001, score=0.894737, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=0.001 .................................
[CV] .. kernel=rbf, C=1000, gamma=0.001, score=0.932331, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=0.001 .................................
[CV] .. kernel=rbf, C=1000, gamma=0.001, score=0.916667, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=0.0001 ................................
[CV] . kernel=rbf, C=1000, gamma=0.0001, score=0.909774, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=0.0001 ................................
[CV] . kernel=rbf, C=1000, gamma=0.0001, score=0.969925, total=   0.0s
[CV] kernel=rbf, C=1000, gamma=0.0001 ................................
[CV] . kernel=rbf, C=1000, gamma=0.0001, score=0.931818, total=   0.0s
[Parallel(n_jobs=1)]: Done  75 out of  75 | elapsed:    1.2s finished
Out[23]:
GridSearchCV(cv=None, error_score='raise',
       estimator=SVC(C=1.0, cache_size=200, class_weight=None, coef0=0.0,
  decision_function_shape=None, degree=3, gamma='auto', kernel='rbf',
  max_iter=-1, probability=False, random_state=None, shrinking=True,
  tol=0.001, verbose=False),
       fit_params={}, iid=True, n_jobs=1,
       param_grid={'kernel': ['rbf'], 'C': [0.1, 1, 10, 100, 1000], 'gamma': [1, 0.1, 0.01, 0.001, 0.0001]},
       pre_dispatch='2*n_jobs', refit=True, return_train_score=True,
       scoring=None, verbose=3)

You can inspect the best parameters found by GridSearchCV in the bestparams attribute, and the best estimator in the best_estimator_ attribute:


In [24]:
grid.best_params_


Out[24]:
{'C': 10, 'gamma': 0.0001, 'kernel': 'rbf'}

In [25]:
grid.best_estimator_


Out[25]:
SVC(C=10, cache_size=200, class_weight=None, coef0=0.0,
  decision_function_shape=None, degree=3, gamma=0.0001, kernel='rbf',
  max_iter=-1, probability=False, random_state=None, shrinking=True,
  tol=0.001, verbose=False)

Then you can re-run predictions on this grid object just like you would with a normal model.


In [26]:
grid_predictions = grid.predict(X_test)

In [27]:
print(confusion_matrix(y_test,grid_predictions))


[[ 60   6]
 [  3 102]]

In [28]:
print(classification_report(y_test,grid_predictions))


             precision    recall  f1-score   support

          0       0.95      0.91      0.93        66
          1       0.94      0.97      0.96       105

avg / total       0.95      0.95      0.95       171

The End!