1252 search results - page 106 / 251 » Minimizing Learned Clauses |
142
click to vote
COLT
2003
Springer
15 years 9 months ago
2003
Springer
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
161
click to vote
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. When faced with the task of building accurate classifiers, active learning is often a beneficial tool for minimizing the requisite costs of human annotation. Traditional ...
143
click to vote
DIS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we explore a topic which is at the intersection of two areas of Machine Learning: namely Support Vector Machines (SVMs) and Inductive Logic Programming (ILP...
137
click to vote
AAAI
2010
15 years 6 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
124
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
In this work we investigate the relationship between Bregman distances and regularized Logistic Regression model. We present a detailed study of Bregman Distance minimization, a f...