Racing trees to query partial data - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Soft Computing Année : 2021

Racing trees to query partial data

Résumé

Dealing with partially known or missing data is a common problem in machine learning. This work is interested in the problem of querying the true value of data to improve the quality of the learned model, when those data are only partially known. This study 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, yet can consider any kind of partial data (not only entirely missing one). We propose a querying strategy 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 decision trees in case of interval-valued features and setvalued labels. The experimental results indicate that, in comparison to other baselines, the proposed approach significantly outperforms simpler strategies in the case
Fichier principal
Vignette du fichier
Racing trees to query partial data.pdf (563.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03341211 , version 1 (10-09-2021)

Identifiants

Citer

Vu-Linh Nguyen, Sébastien Destercke, Marie-Hélène Masson, Rashad Ghassani. Racing trees to query partial data. Soft Computing, 2021, 25, pp.9285-9305. ⟨10.1007/s00500-021-05872-5⟩. ⟨hal-03341211⟩
98 Consultations
71 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More