701 search results - page 73 / 141 » Self Bounding Learning Algorithms |
JMLR
2010
13 years 2 months ago
2010
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic fun...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...
AIMSA
2008
Springer
14 years 2 months ago
2008
Springer
Relational instance-based learning (RIBL) algorithms offer high prediction capabilities. However, they do not scale up well, specially in domains where there is a time bound for c...
JSAT
2006
13 years 7 months ago
2006
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
COLT
1995
Springer
13 years 11 months ago
1995
Springer
We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for...