# Machine Learning - Rote Classifier

## 1 - About

The “rote” classifier classifies data items based on exact matches to the training set. Otherwise, it search in the training set for one that’s “most like” it. The key concept here is the description of what means “most like” (for instance: randomly)

It's the simplest form of learning.

It's a algorithm based on distance calculation from the training data set.

The training instances are the data structures and represent the “knowledge”. The representation of knowledge is then just the set of instances.

There is then no model. It's a kind of lazy algorithm. It's a lazy learning algorithm as it will do nothing until you have to make predictions.

## 3 - Algorithm

It just remembers the training instance and then to classify a new instance it search the training set for one that is “most like” a new instance.

### 3.1 - Randomly

“Most like” algorithm as a pure guess:

If the record exactly match a previous record then
assign the same class as the previous record
else
just guess

### 3.2 - k nearest neighbour

data_mining/rote.txt · Last modified: 2013/10/12 08:46 by gerardnico