Algorithme des k plus proches voisins à cible structurée


Révision datée du 18 décembre 2020 à 18:16 par Pitpitt (discussion | contributions) (Page créée avec « ==en construction== == Définition == XXXXXXXXX == Français == ''' XXXXXXXXX ''' == Anglais == ''' Structured kNN''' Structured k-Nearest Neighbours [1] [2] [3] is a... »)
(diff) ← Version précédente | Voir la version actuelle (diff) | Version suivante → (diff)

en construction

Définition

XXXXXXXXX

Français

XXXXXXXXX

Anglais

Structured kNN

Structured k-Nearest Neighbours [1] [2] [3] is a machine learning algorithm that generalizes the k-Nearest Neighbors (kNN) classifier. Whereas the kNN classifier supports binary classification, multiclass classification and regression,[4] the Structured kNN (SkNN) allows training of a classifier for general structured output labels.

As an example, a sample instance might be a natural language sentence, and the output label is an annotated parse tree. Training a classifier consists of showing pairs of correct sample and output label pairs. After training, the structured kNN model allows one to predict for new sample instances the corresponding output label; that is, given a natural language sentence, the classifier can produce the most likely parse tree.


Source : Source : Wikipedia

Source : Wikipedia Machine learning algorithms



Contributeurs: Patrick Drouin, wiki