417 search results - page 11 / 84 » Some Theory for Generalized Boosting Algorithms |
AIMSA
2000
Springer
14 years 2 days ago
2000
Springer
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
FCT
2003
Springer
14 years 28 days ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
A general model is proposed for studying ranking problems. We investigate learning methods based on empirical minimization of the natural estimates of the ranking risk. The empiric...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
IJCAI
2003
13 years 9 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...