Evidential Nearest Neighbours in Active Learning

Daniel Zhu (1) , Arnaud Martin (1) , Yolande Le Gall (1) , Jean-Christophe Dubois (1) , Vincent Lemaire (2)

1 DRUID - Declarative & Reliable management of Uncertain, user-generated Interlinked Data
2 Orange Labs [Lannion]

Active learning is a subfield of machine learning which allows to reduce the amount of data necessary to train a classifier. The training set is built in an iterative way such that only the most significant and informative data are used and labeled by an external person called oracle. It is furthermore possible to use active learning with the theory of belief functions in order to take erroneous labels due to the oracle's uncertainty and imprecision into account in order to limit their influence on the classifier's performance. In this article, we compare the classifier of the k nearest neighbours (kNN) to a variant based on belief functions from the theory of belief functions (EkNN), in a situation where some labels have been noised in order to model uncertain labels. We show that although the superiority of EkNN over kNN is not systematic, there are some interesting and modest results supporting the relevance of belief functions in active learning.

Mots clés: Active Learning; Belief Functions; Theory of Dempster-Shafer; Nearest Neighbours

Domaines: Informatique [cs]; Intelligence artificielle [cs.AI]

Daniel Zhu, Arnaud Martin, Yolande Le Gall, Jean-Christophe Dubois, Vincent Lemaire. Evidential Nearest Neighbours in Active Learning. Worksop on Interactive Adaptive Learning (IAL) - ECML-PKDD, Sep 2021, Bilbao, Spain. ⟨hal-03327629⟩