Sciweavers

1419 search results - page 22 / 284
» Approximation Methods for Supervised Learning
Sort
View
JMLR
2010
140views more  JMLR 2010»
13 years 3 months ago
Learning From Crowds
For many supervised learning tasks it may be infeasible (or very expensive) to obtain objective and reliable labels. Instead, we can collect subjective (possibly noisy) labels fro...
Vikas C. Raykar, Shipeng Yu, Linda H. Zhao, Gerard...
KDD
2001
ACM
166views Data Mining» more  KDD 2001»
14 years 9 months ago
Generalized clustering, supervised learning, and data assignment
Clustering algorithms have become increasingly important in handling and analyzing data. Considerable work has been done in devising effective but increasingly specific clustering...
Annaka Kalton, Pat Langley, Kiri Wagstaff, Jungsoo...
NAACL
2007
13 years 10 months ago
Using "Annotator Rationales" to Improve Machine Learning for Text Categorization
We propose a new framework for supervised machine learning. Our goal is to learn from smaller amounts of supervised training data, by collecting a richer kind of training data: an...
Omar Zaidan, Jason Eisner, Christine D. Piatko
ICML
2005
IEEE
14 years 9 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
CORR
2004
Springer
125views Education» more  CORR 2004»
13 years 8 months ago
Word Sense Disambiguation by Web Mining for Word Co-occurrence Probabilities
This paper describes the National Research Council (NRC) Word Sense Disambiguation (WSD) system, as applied to the English Lexical Sample (ELS) task in Senseval-3. The NRC system ...
Peter D. Turney