KNN#

class capymoa.classifier.KNN[source]#

Bases: MOAClassifier

K-Nearest Neighbors.

K-Nearest Neighbors (KNN) [1] is a lazy classifier. KNN in the streaming setting [2] stores a window of the most recent instances and uses them to classify new instances based on the majority class among the k-nearest neighbors.

>>> from capymoa.classifier import KNN
>>> from capymoa.datasets import ElectricityTiny
>>> from capymoa.evaluation import prequential_evaluation
>>>
>>> stream = ElectricityTiny()
>>> classifier = KNN(stream.get_schema())
>>> results = prequential_evaluation(stream, classifier, max_instances=1000)
>>> print(f"{results['cumulative'].accuracy():.1f}")
80.7

See also

SAMkNN

Self Adjusted Memory k-Nearest Neighbor (SAMkNN) classifier.

__init__(schema=None, CLI=None, random_seed=1, k=3, window_size=1000)[source]#
cli_help()[source]#
predict(instance)[source]#

Predict the label of an instance.

The base implementation calls predict_proba() and returns the label with the highest probability.

Parameters:

instance – The instance to predict the label for.

Returns:

The predicted label or None if the classifier is unable to make a prediction.

predict_proba(instance)[source]#

Return probability estimates for each label.

Parameters:

instance – The instance to estimate the probabilities for.

Returns:

An array of probabilities for each label or None if the classifier is unable to make a prediction.

train(instance)[source]#

Train the classifier with a labeled instance.

Parameters:

instance – The labeled instance to train the classifier with.

random_seed: int#

The random seed for reproducibility.

When implementing a classifier ensure random number generators are seeded.

schema: Schema#

The schema representing the instances.