Sciweavers

297 search results - page 34 / 60
» Learning from Ambiguously Labeled Examples
Sort
View
ACL
1996
14 years 8 days ago
Minimizing Manual Annotation Cost in Supervised Training from Corpora
Corpus-based methods for natural language processing often use supervised training, requiring expensive manual annotation of training corpora. This paper investigates methods for ...
Sean P. Engelson, Ido Dagan
ICMLA
2010
13 years 9 months ago
Boosting Multi-Task Weak Learners with Applications to Textual and Social Data
Abstract--Learning multiple related tasks from data simultaneously can improve predictive performance relative to learning these tasks independently. In this paper we propose a nov...
Jean Baptiste Faddoul, Boris Chidlovskii, Fabien T...
FOCS
2009
IEEE
14 years 5 months ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...
JMLR
2006
99views more  JMLR 2006»
13 years 11 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
RIAO
2007
14 years 11 days ago
From Layout to Semantic: a Reranking Model for Mapping Web Documents to Mediated XML Representations
Many documents on the Web are formated in a weakly structured format. Because of their weak semantic and because of the heterogeneity of their formats, the information conveyed by...
Guillaume Wisniewski, Patrick Gallinari