Average-Case Active Learning with Costs

DOI10.1007/978-3-642-04414-4_15zbMath1262.68067arXiv0905.2997OpenAlexW2155642407MaRDI QIDQ3648749

Andrew Guillory, Jeff A. Bilmes

Publication date: 1 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.2997

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (7)

Decision tree classification with bounded number of errors ⋮ Decision trees for function evaluation: simultaneous optimization of worst and expected cost ⋮ Trading off worst and expected cost in decision tree problems ⋮ Annotation cost-sensitive active learning by tree sampling ⋮ Adaptive Submodular Ranking and Routing ⋮ Approximating decision trees with value dependent testing costs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Decision trees for entity identification
• Approximating Optimal Binary Decision Trees
• Approximating Decision Trees with Multiway Branches
• Teaching Dimension and the Complexity of Active Learning
• Elements of Information Theory

This page was built for publication: Average-Case Active Learning with Costs