Partial data querying through racing algorithms

DOI10.1016/J.IJAR.2018.03.005zbMath1444.68160OpenAlexW2791951942MaRDI QIDQ1644806

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

Publication date: 22 June 2018

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2018.03.005

zbMATH Keywords

interval-valued dataactive learningpartial datadata queryingracing algorithmsset-valued labels

Mathematics Subject Classification ID

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

Related Items (2)

Editorial: Uncertainty management in machine learning applications ⋮ Racing trees to query partial data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of active learning in collaborative filtering recommender systems
• Decision making under uncertainty using imprecise probabilities
• Learning monotone nonlinear models using the Choquet integral
• Classification with support vector machines and Kolmogorov-Smirnov bounds
• Learning from imprecise and fuzzy observations: data disambiguation through generalized loss minimization
• 10.1162/153244302760185243
• A Pedagogical History of Compactness

This page was built for publication: Partial data querying through racing algorithms