Machine learning classification#

Building machine learning models to assign data to classes.

Machine learning has become an increasingly popular tool for solving classification problems.

The goal is to assign data points to pre-defined classes based on their features or attributes. This technique has numerous applications in a wide range of fields, from image and speech recognition to fraud detection and spam filtering. Building machine learning models to assign data to classes involves training algorithms on labelled datasets. Each data point is associated with a specific class label. By analyzing the relationships between the input features and the output labels, these models can learn to accurately classify new, unseen data points with high accuracy.

In this way, machine learning provides a powerful tool for automating classification tasks and enabling more efficient and effective decision-making.

How To#

from sklearn.model_selection import train_test_split
import pandas as pd

df = pd.read_csv("data/housing.csv")
df.head()
longitude latitude housing_median_age total_rooms total_bedrooms population households median_income median_house_value ocean_proximity
0 -122.23 37.88 41.0 880.0 129.0 322.0 126.0 8.3252 452600.0 NEAR BAY
1 -122.22 37.86 21.0 7099.0 1106.0 2401.0 1138.0 8.3014 358500.0 NEAR BAY
2 -122.24 37.85 52.0 1467.0 190.0 496.0 177.0 7.2574 352100.0 NEAR BAY
3 -122.25 37.85 52.0 1274.0 235.0 558.0 219.0 5.6431 341300.0 NEAR BAY
4 -122.25 37.85 52.0 1627.0 280.0 565.0 259.0 3.8462 342200.0 NEAR BAY 
df = df.dropna()

x_train, x_, y_train, y_ = train_test_split(df.drop(["longitude","latitude","ocean_proximity"], axis=1), 
                                                    df.ocean_proximity, test_size=.5)

x_val, x_test, y_val, y_test = train_test_split(x_, y_, test_size=.5)

Nearest Neighbours#

from sklearn.neighbors import KNeighborsClassifier

model = KNeighborsClassifier(n_neighbors=10)

model.fit(x_train, y_train)

KNeighborsClassifier(n_neighbors=10)
In a Jupyter environment, please rerun this cell to show the HTML representation or trust the notebook.
On GitHub, the HTML representation is unable to render, please try loading this page with nbviewer.org.
model.score(x_val, y_val)

0.6082615505090054

Random Forest#

from sklearn.ensemble import RandomForestClassifier

rf = RandomForestClassifier()

rf.fit(x_train, y_train)

RandomForestClassifier()
In a Jupyter environment, please rerun this cell to show the HTML representation or trust the notebook.
On GitHub, the HTML representation is unable to render, please try loading this page with nbviewer.org.
rf.score(x_val, y_val)

0.6667971808927173

rf.feature_importances_

array([0.12130783, 0.12591522, 0.10431523, 0.12629487, 0.10788281,
       0.13096613, 0.28331791])

Logistic Regression#

from sklearn.linear_model import LogisticRegression

model = LogisticRegression(max_iter=10000)

model.fit(x_train, y_train)

LogisticRegression(max_iter=10000)
In a Jupyter environment, please rerun this cell to show the HTML representation or trust the notebook.
On GitHub, the HTML representation is unable to render, please try loading this page with nbviewer.org.
model.score(x_val, y_val)

0.5871182458888019

model.coef_

array([[-1.16903632e-02,  8.27392111e-05,  3.79241080e-04,
         1.68184911e-03, -4.75610637e-04, -3.98651838e-04,
         6.75121078e-06],
       [ 2.46743195e-02,  1.20089827e-03,  2.76599549e-03,
         1.13044903e-03, -6.02389187e-03,  2.97456590e-03,
        -5.65323671e-06],
       [-3.50649147e-04, -2.01748291e-03, -1.09154893e-04,
        -2.58094817e-03, -5.44039445e-04, -3.11430255e-05,
        -8.22050225e-06],
       [ 1.99856196e-03,  5.05918999e-04, -3.85903131e-03,
        -9.07400502e-04,  6.91995322e-03, -1.04618467e-03,
         2.95843595e-06],
       [-1.46318691e-02,  2.27926434e-04,  8.22949640e-04,
         6.76050537e-04,  1.23588725e-04, -1.49858637e-03,
         4.16409223e-06]])

Exercise#

Test different numbers of neighbours for the KNN classifier and see how pre-processing like scaling affects our results.

Additional Resources#