Cost-Minimising Strategies for Data Labelling: Optimal Stopping and Active Learning

13 years 5 months ago

Download eprints.pascal-network.org

Supervised learning deals with the inference of a distribution over an output or label space Y conditioned on points in an observation space X , given a training dataset D of pairs in X

Christos Dimitrakakis, Christian Savu-Krohn

Real-time Traffic

Active Learning | FOIKS 2008 | Information Management | Label | Optimal Stopping |

posted by olethros

» Active and Semisupervised Data Domain Description

» Efficiently learning the accuracy of labeling sources for selective sampling

» NearestNeighborBased Active Learning for Rare Category Detection

» Active Ordering of Interactive Prediction Tasks

Post Info
More Details (n/a)

Added	26 Oct 2010
Updated	15 Dec 2011
Type	Conference
Year	2008
Where	FOIKS
Authors	Christos Dimitrakakis, Christian Savu-Krohn

Comments (0)

	Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning 509 views
	Reid et al.'s Distance Bounding Protocol and Mafia Fraud Attacks over Noisy Channels 545 views
	Rollout Sampling Approximate Policy Iteration 334 views
	Bayesian variable order Markov models. 404 views
	Statistical Decision Making for Authentication and Intrusion Detection 634 views

Sciweavers

Cost-Minimising Strategies for Data Labelling: Optimal Stopping and Active Learning

Active Learning | FOIKS 2008 | Information Management | Label | Optimal Stopping |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers