Sciweavers

6 search results - page 1 / 2
» Cost-Minimising Strategies for Data Labelling: Optimal Stopp...
Sort
View
FOIKS
2008
Springer
13 years 6 months ago
Cost-Minimising Strategies for Data Labelling: Optimal Stopping and Active Learning
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 pair...
Christos Dimitrakakis, Christian Savu-Krohn
FOIKS
2008
Springer
14 years 1 months ago
Cost-minimising strategies for data labelling : optimal stopping and active learning
Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$...
Christos Dimitrakakis, Christian Savu-Krohn
PKDD
2009
Springer
174views Data Mining» more  PKDD 2009»
13 years 11 months ago
Active and Semi-supervised Data Domain Description
Data domain description techniques aim at deriving concise descriptions of objects belonging to a category of interest. For instance, the support vector domain description (SVDD) l...
Nico Görnitz, Marius Kloft, Ulf Brefeld
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
14 years 5 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
NIPS
2007
13 years 6 months ago
Nearest-Neighbor-Based Active Learning for Rare Category Detection
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
Jingrui He, Jaime G. Carbonell