65 search results - page 9 / 13 » A bound on the label complexity of agnostic active learning |
COLT
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
CEAS
2006
Springer
13 years 9 months ago
2006
Springer
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
FOCS
2010
IEEE
13 years 3 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
KI
2007
Springer
13 years 12 months ago
2007
Springer
Learning patterns of human behavior from sensor data is extremely important for high-level activity inference. We show how to extract and label a person’s activities and signi...
ICCV
2011
IEEE
12 years 5 months ago
2011
IEEE
We propose a framework for large scale learning and annotation of structured models. The system interleaves interactive labeling (where the current model is used to semiautomate t...