Sciweavers

63 search results - page 1 / 13
» Entropy Regularized LPBoost
Sort
View
ALT
2008
Springer
14 years 1 months ago
Entropy Regularized LPBoost
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...
Manfred K. Warmuth, Karen A. Glocer, S. V. N. Vish...
ICDM
2005
IEEE
185views Data Mining» more  ICDM 2005»
13 years 10 months ago
Semi-Supervised Mixture of Kernels via LPBoost Methods
We propose an algorithm to construct classification models with a mixture of kernels from labeled and unlabeled data. The derived classifier is a mixture of models, each based o...
Jinbo Bi, Glenn Fung, Murat Dundar, R. Bharat Rao
NIPS
2007
13 years 6 months ago
Boosting Algorithms for Maximizing the Soft Margin
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
NAACL
2010
13 years 2 months ago
Unsupervised Model Adaptation using Information-Theoretic Criterion
In this paper we propose a novel general framework for unsupervised model adaptation. Our method is based on entropy which has been used previously as a regularizer in semi-superv...
Ariya Rastrow, Frederick Jelinek, Abhinav Sethy, B...
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 1 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel