502 search results - page 10 / 101 » Learning from General Label Constraints |
NIPS
2007
13 years 11 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
NIPS
2007
13 years 11 months ago
2007
Semi-supervised inductive learning concerns how to learn a decision rule from a data set containing both labeled and unlabeled data. Several boosting algorithms have been extended...
NAACL
2010
13 years 7 months ago
2010
Extraction of entities from ad creatives is an important problem that can benefit many computational advertising tasks. Supervised and semi-supervised solutions rely on labeled da...
ISPA
2007
Springer
14 years 4 months ago
2007
Springer
A concept hierarchy is a kind of general form of knowledge representation. Most of the previous researches on describing the concept hierarchy use tree-like crisp taxonomy. However...
IJON
2008
13 years 9 months ago
2008
Identifiability becomes an essential requirement for learning machines when the models contain physically interpretable parameters. This paper presents two approaches to examining...