Sciweavers

1252 search results - page 61 / 251
» Minimizing Learned Clauses
Sort
View
81
Voted
AICOM
2006
129views more  AICOM 2006»
14 years 10 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone
ML
2006
ACM
110views Machine Learning» more  ML 2006»
14 years 9 months ago
Classification-based objective functions
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
Michael Rimer, Tony Martinez
ICML
2008
IEEE
15 years 10 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...
AAAI
1994
14 years 11 months ago
Improving Learning Performance Through Rational Resource Allocation
This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning...
Jonathan Gratch, Steve A. Chien, Gerald DeJong
CORR
2006
Springer
127views Education» more  CORR 2006»
14 years 9 months ago
Semi-Supervised Learning -- A Statistical Physics Approach
We present a novel approach to semisupervised learning which is based on statistical physics. Most of the former work in the field of semi-supervised learning classifies the point...
Gad Getz, Noam Shental, Eytan Domany