Many a times while working on a dataset and using a Machine Learning model we don"t know which set of hyperparameters will give us the best result. Passing all sets of hyperparameters manually through the model and checking the result might be a hectic work and may not be possible to do.
To get the best set of hyperparameters we can use Grid Search. Grid Search passes all combinations of hyperparameters one by one into the model and check the result. Finally it gives us the set of hyperparemeters which gives the best result after passing in the model.
So this recipe is a short example of how can can use nearest neighbours for Regression.
from sklearn import decomposition, datasets from sklearn import neighbors from sklearn.pipeline import Pipeline from sklearn.model_selection import GridSearchCV, cross_val_score from sklearn.preprocessing import StandardScaler
Here we have imported various modules like decomposition, datasets, tree, Pipeline, StandardScaler and GridSearchCV from differnt libraries. We will understand the use of these later while using it in the in the code snipet.
For now just have a look on these imports.
Here we have created a regression dataset with python datasets.
dataset = datasets.make_regression(n_samples=1000, n_features=20, n_informative=10,
n_targets=1, bias=0.0, effective_rank=None, tail_strength=0.5, noise=0.0,
shuffle=True, coef=False, random_state=None)
X = dataset
y = dataset
StandardScaler is used to remove the outliners and scale the data by making the mean of the data 0 and standard deviation as 1. So we are creating an object std_scl to use standardScaler.
std_slc = StandardScaler()
We are also using Principal Component Analysis(PCA) which will reduce the dimension of features by creating new features which have most of the varience of the original data.
pca = decomposition.PCA()
Here, we are using KNeighbors Regressor as a Machine Learning model to use GridSearchCV. So we have created an object KNN.
KNN = neighbors.KNeighborsRegressor()
Pipeline will helps us by passing modules one by one through GridSearchCV for which we want to get the best parameters. So we are making an object pipe to create a pipeline for all the three objects std_scl, pca and knn.
pipe = Pipeline(steps=[("std_slc", std_slc),
Now we have to define the parameters that we want to optimise for these three objects.
StandardScaler doesnot requires any parameters to be optimised by GridSearchCV.
Principal Component Analysis requires a parameter "n_components" to be optimised. "n_components" signifies the number of components to keep after reducing the dimension.
n_components = list(range(1,X.shape+1,1))
DecisionTreeClassifier requires two parameters "n_neighbors" and "algorithm" to be optimised by GridSearchCV. So we have set these two parameters as a list of values form which GridSearchCV will select the best value of parameter.
n_neighbors = [2, 3, 5, 10]
algorithm = ["auto", "ball_tree", "kd_tree", "brute"]
Now we are creating a dictionary to set all the parameters options for different objects.
parameters = dict(pca__n_components=n_components,
Before using GridSearchCV, lets have a look on the important parameters.
clf = GridSearchCV(pipe, parameters) clf.fit(X, y)Now we are using print statements to print the results. It will give the values of hyperparameters as a result.
print("Best Number Of Components:", clf.best_estimator_.get_params()["pca__n_components"]) print(); print(clf.best_estimator_.get_params()["KNN"]) CV_Result = cross_val_score(clf, X, y, cv=3, n_jobs=-1, scoring="r2") print(); print(CV_Result) print(); print(CV_Result.mean()) print(); print(CV_Result.std())As an output we get:
Best Number Of Components: 20 KNeighborsRegressor(algorithm="auto", leaf_size=30, metric="minkowski", metric_params=None, n_jobs=None, n_neighbors=10, p=2, weights="uniform") [0.60800965 0.53874633 0.57159348] 0.5727831547316445 0.028289142973677704