48 search results - page 4 / 10 » Entropy and Margin Maximization for Structured Output Learni... |
124
Voted
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
136
Voted
ICMLA
2009
15 years 1 months ago
2009
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
111
click to vote
ALT
2008
Springer
16 years 17 days ago
2008
Springer
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
145
Voted
AAAI
2010
15 years 1 months ago
2010
Multi-instance learning, as other machine learning tasks, also suffers from the curse of dimensionality. Although dimensionality reduction methods have been investigated for many ...
146
Voted
NIPS
2008
15 years 5 months ago
2008
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...