Sciweavers

Share
ALT
1998
Springer

Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries

9 years 9 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 all the other ones of the concept class under consideration. For a domain consisting of all integer points of some polytope we give non-trivial lower bounds on the complexity of exact identification of half-spaces. These bounds are near to known upper bounds.
Valery N. Shevchenko, Nikolai Yu. Zolotykh
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where ALT
Authors Valery N. Shevchenko, Nikolai Yu. Zolotykh
Comments (0)
books