Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Learning via finitely many queries

Learning via finitely many queries This work introduces a new query inference model that can access data and communicate with the 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. Results suggest that this model may help studying query inference in a resource bounded environment. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Learning via finitely many queries

Loading next page...
 
/lp/springer-journals/learning-via-finitely-many-queries-ylLeGKlE4l

References (39)

Publisher
Springer Journals
Copyright
Copyright © 2005 by Springer
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Mathematics, general; Computer Science, general; Complex Systems
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1007/s10472-005-7035-0
Publisher site
See Article on Publisher Site

Abstract

This work introduces a new query inference model that can access data and communicate with the 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. Results suggest that this model may help studying query inference in a resource bounded environment.

Journal

Annals of Mathematics and Artificial IntelligenceSpringer Journals

Published: May 10, 2005

There are no references for this article.