SUPERVISED LEARNING

-Labeled Data

-Direct Feedback

-Predict outcome/future

- Classification and Regression Tasks

The main goal of supervised learning is to learn a model from labeled training data that allows us to
make predictions about unseen or future data.

TRAINING DATASET

DATA MINING METHODS

TEST DATA SET (A NEW

PREDICTIVE MODEL PREDICTION
DATA)

UNSUPERVISED LEARNING

- NO LABELS DATA
- NO FEEDBACK
- FIND HIDDEN STRUCTURE IN DATA

Unsupervised Learning we are able to explore the structure of our data to extract meaningful
information without the guidance of a known outcome.

-Clustering methods can be examined under this title.

OUR FIRST CLASSIFICATION ALGORITHM THE KNN ALGORTIHM (K_NEAREST NEIGHBORS)

KNN is a type of a lazy learner. That is because of its simplicity and because it doesn’t learn a
discriminative function from the training dataset, but memorizes the training dataset.

- Choose the number of K and a distance metric

- Find the k-nearest neighbors of the sample that we want to classify

- Assign the class label by majority vote

Based on the chosen distance distance metric, The KNN finds the k samples in the training dataset that
are closest to the point that we want to classify. The class label of the new data point is then
determinded by a majority vote among this k-nearest neighbors.

EUCLIDEAN DISTANCE

√
D((5,3) , (1,2))¿ ( 5−1 )2 +(3−2)2

Normalization Formulas:
Min-Max Normalization:

X −X min
X’=
X max −¿ X ¿
min

Z-Score normalization

= Mean

= Standard deviation