Partial data querying through racing algorithms

DOI10.1016/J.IJAR.2018.03.005MaRDI QIDQ1644806zbMATH OpenOpenAlexFDO

Authors Vu-Linh Nguyen, M.-H. Masson, S. 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

partial dataactive learninginterval-valued 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)

Recommendations

• Racing trees to query partial data
• Active learning
• Active learning with adaptive regularization
• Two faces of active learning
• Bayesian active learning using arbitrary binary valued queries

Cites work

• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• A Pedagogical History of Compactness
• A survey of active learning in collaborative filtering recommender systems
• Advanced calculus
• Classification with support vector machines and Kolmogorov-Smirnov bounds
• Decision making under uncertainty using imprecise probabilities
• Learning from imprecise and fuzzy observations: data disambiguation through generalized loss minimization
• Learning from partial labels
• Learning monotone nonlinear models using the Choquet integral
• Support vector machine active learning with applications to text classification

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1644806)