3416 search results - page 22 / 684 » Can Machines Learn Logics |
142
click to vote
ICML
2004
IEEE
16 years 6 months ago
2004
IEEE
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
169
click to vote
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
147
click to vote
ICML
2000
IEEE
16 years 6 months ago
2000
IEEE
We study the problem of learning using combinations of machines. In particular we present new theoretical bounds on the generalization performance of voting ensembles of kernel ma...
153
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We investigate here concept learning from incomplete examples. Our first purpose is to discuss to what extent logical learning settings have to be modified in order to cope with da...
152
click to vote
ECML
2007
Springer
16 years 1 days ago
2007
Springer
We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm i...