Sciweavers

745 search results - page 6 / 149
» A Preference Model for Structured Supervised Learning Tasks
Sort
View
ML
2002
ACM
178views Machine Learning» more  ML 2002»
14 years 9 months ago
Metric-Based Methods for Adaptive Model Selection and Regularization
We present a general approach to model selection and regularization that exploits unlabeled data to adaptively control hypothesis complexity in supervised learning tasks. The idea ...
Dale Schuurmans, Finnegan Southey
70
Voted
OSDI
2008
ACM
15 years 9 months ago
An Internet Protocol Address Clustering Algorithm
We pose partitioning a b-bit Internet Protocol (IP) address space as a supervised learning task. Given (IP, property) labeled training data, we develop an IP-specific clustering a...
Robert Beverly, Karen R. Sollins
ICML
2010
IEEE
14 years 10 months ago
Label Ranking under Ambiguous Supervision for Learning Semantic Correspondences
This paper studies the problem of learning from ambiguous supervision, focusing on the task of learning semantic correspondences. A learning problem is said to be ambiguously supe...
Antoine Bordes, Nicolas Usunier, Jason Weston
EMNLP
2007
14 years 11 months ago
Semi-Supervised Structured Output Learning Based on a Hybrid Generative and Discriminative Approach
This paper proposes a framework for semi-supervised structured output learning (SOL), specifically for sequence labeling, based on a hybrid generative and discriminative approach...
Jun Suzuki, Akinori Fujino, Hideki Isozaki
NIPS
2003
14 years 11 months ago
Log-Linear Models for Label Ranking
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
Ofer Dekel, Christopher D. Manning, Yoram Singer