Partial Data Querying Through Racing Algorithms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Partial Data Querying Through Racing Algorithms

Résumé

This paper studies the problem of learning from instances characterized by imprecise features or imprecise class labels. Our work is in the line of active learning, since we consider that the precise value of some partial data can be queried to reduce the uncertainty in the learning process. Our work is based on the concept of racing algorithms in which several models are competing. The idea is to identify the query that will help the most to quickly decide the winning model in the competition. After discussing and formalizing the general ideas of our approach, we study the particular case of binary SVM and give the results of some preliminary experiments.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
IUKM_2016_paper_17.pdf (379.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01396223 , version 1 (14-11-2016)

Identifiants

Citer

Vu-Linh Nguyen, Sébastien Destercke, Marie-Hélène Masson. Partial Data Querying Through Racing Algorithms. International Symposium on Integrated Uncertainty in Knowledge Modelling and Decision Making (IUKM 2016), Nov 2016, Da Nang, Vietnam. pp.163-174, ⟨10.1007/978-3-319-49046-5_14⟩. ⟨hal-01396223⟩
234 Consultations
153 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More