Racing trees to query partial data
type: Item
instance of: scholarly article
title: Racing trees to query partial data
zbMATH Open document ID: 1498.68253
author: Vu-Linh Nguyen
author: S. Destercke
author: Rashad Ghassani
author: M.-H. Masson
published in: Soft Computing
publication date: 2022-11-21T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 62D10
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 7621287
zbMATH Keywords: partial data
zbMATH Keywords: data querying
zbMATH Keywords: active learning
zbMATH Keywords: racing algorithms
zbMATH Keywords: decision trees
describes a project that uses: FURIA
MaRDI profile type: Publication
full work available at URL: s00500-021-05872-5
OpenAlex ID: W3162317269
cites work: Preference-based reinforcement learning: evolutionary direct policy search using a preference-based racing algorithm
cites work: Q5396650
cites work: Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
cites work: Comparing probability measures using possibility theory: a notion of relative peakedness
cites work: Censored Data and the Bootstrap
cites work: Impact of imputation of missing values on classification error for discrete data
cites work: Ignorability and Coarse Data: Some Biomedical Examples
cites work: Learning from imprecise and fuzzy observations: data disambiguation through generalized loss minimization
cites work: Online active learning of decision trees with evidential data
cites work: Partial data querying through racing algorithms
cites work: Inference and missing data
cites work: Decision making under uncertainty using imprecise probabilities
DOI: 10.1007/S00500-021-05872-5
description: scientific article; zbMATH DE number 7621287