Sciweavers

Share
AMAI
2004
Springer

Learning via Finitely Many Queries

10 years 1 months ago
Learning via Finitely Many Queries
This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the parameters of interest are the number of queries used and the expressive power of L. We study how the learning power varies with these parameters. Preliminary results suggest that this model can help studying query inference in an resource bounded environment.
Andrew C. Lee
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where AMAI
Authors Andrew C. Lee
Comments (0)
books