463 search results - page 50 / 93 » Induction in Noisy Domains |
101
click to vote
JAIR
2010
14 years 10 months ago
2010
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
ICML
2004
IEEE
16 years 19 days ago
2004
IEEE
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...
ICFP
2008
ACM
15 years 11 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
AB
2007
Springer
15 years 6 months ago
2007
Springer
Whenever a programmer writes a loop, or a mathematician does a proof by induction, an invariant is involved. The discovery and understanding of invariants often underlies problem s...
140
click to vote
ICDM
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper we address the problem of learning the Markov blanket of a quantity from data in an efficient manner. Markov blanket discovery can be used in the feature selection ...