Racing trees to query partial data

DOI10.1007/s00500-021-05872-5zbMath1498.68253OpenAlexW3162317269MaRDI QIDQ2100239

Vu-Linh Nguyen, Rashad Ghassani, Sebastien Destercke, Marie-Hélène Masson

Publication date: 21 November 2022

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-021-05872-5

zbMATH Keywords

decision treesactive learningpartial datadata queryingracing algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Missing data (62D10)

Uses Software

• FURIA

Cites Work

• Unnamed Item
• Impact of imputation of missing values on classification error for discrete data
• Decision making under uncertainty using imprecise probabilities
• Comparing probability measures using possibility theory: a notion of relative peakedness
• Partial data querying through racing algorithms
• Online active learning of decision trees with evidential data
• Learning from imprecise and fuzzy observations: data disambiguation through generalized loss minimization
• Preference-based reinforcement learning: evolutionary direct policy search using a preference-based racing algorithm
• Censored Data and the Bootstrap
• Inference and missing data
• Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
• Ignorability and Coarse Data: Some Biomedical Examples

This page was built for publication: Racing trees to query partial data