Querying Partially Labelled Data to Improve a K-nn Classifier

Vu-Linh Nguyen (1) , Sébastien Destercke (1, 2) , Marie-Hélène Masson (3, 2, 1)

1 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
2 Labex MS2T - Laboratoire d'Excellence "Maîtrise des Systèmes de Systèmes Technologiques"
3 UPJV - Université de Picardie Jules Verne

When learning from instances whose output labels may be partial, the problem of knowing which of these output labels should be made precise to improve the accuracy of predictions arises. This problem can be seen as the intersection of two tasks: the one of learning from partial labels and the one of active learning, where the goal is to provide the labels of additional instances to improve the model accuracy. In this paper, we propose querying strategies of partial labels for the well-known K-nn classifier. We propose different criteria of increasing complexity, using among other things the amount of ambiguity that partial labels introduce in the K-nn decision rule. We then show that our strategies usually outperform simple baseline schemes, and that more complex strategies provide a faster improvement of the model accuracies.

Domaines: Autre [cs.OH]

Vu-Linh Nguyen, Sébastien Destercke, Marie-Hélène Masson. Querying Partially Labelled Data to Improve a K-nn Classifier. Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), Feb 2017, San Francisco, CA, United States. pp.2401-2407. ⟨hal-01421610⟩