Sciweavers

176 search results - page 5 / 36
» The complexity of properly learning simple concept classes
Sort
View
LICS
2000
IEEE
14 years 1 months ago
The Role of Decidability in First Order Separations over Classes of Finite Structures
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
Steven Lindell, Scott Weinstein
ILP
2003
Springer
14 years 2 months ago
Complexity Parameters for First-Order Classes
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
Marta Arias, Roni Khardon
SOFSEM
1999
Springer
14 years 1 months ago
Coherent Concepts, Robust Learning
We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. Thi...
Dan Roth, Dmitry Zelenko
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 8 months ago
Logical settings for concept learning from incomplete examples in First Order Logic
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...
Dominique Bouthinon, Henry Soldano, Véroniq...
ALT
1998
Springer
14 years 1 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh