Abstract
Query learning models the learning process as a dialogue between a pupil (learner) and a teacher; the learner has to figure out the target concept by asking questions of certain types and whenever the teacher answers these questions correctly, the learner has to learn within the given complexity bounds. Complexity can be measured by both, the number of queries as well as the computational complexity of the learner. Query learning has close connections to statistical models like PAC learning.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Recommended Reading
Aizenstein H, Pitt L (1995) On the learnability of disjunctive normal form formulas. Mach Learn 19(3):183–208
Aizenstein H, Hellerstein L, Pitt L (1992) Read-thrice DNF is hard to learn with membership and equivalence queries. In: Thirty-third annual symposium on foundations of computer science, Pittsburgh, 24–27 Oct 1992. IEEE Computer Society, Washington, DC, pp 523–532
Angluin D (1987) Learning regular sets from queries and counterexamples. Info Comput 75(2):87–106
Angluin D (1988) Queries and concept learning. Mach Learn 2(4):319–342
Angluin D (1990) Negative results for equivalence queries. Mach Learn 5:121–150
Angluin D (2004) Queries revisited. Theor Comput Sci 313:175–194
Angluin D, Frazier M, Pitt L (1992) Learning conjunctions of Horn clauses. Mach Learn 9:147–164
Angluin D, Hellerstein L, Karpinski M (1993) Learning read-once formulas with queries. J Assoc Comput Mach 40:185–210
Arias M (2004) Exact learning of first-order Horn expressions from queries. Ph.D. thesis, Tufts University
Arias M, Balcázar JL (2009) Canonical Horn representations and query learning. In: Algorithmic learning theory: twentieth international conference ALT 2009. LNAI, vol 5809. Springer, Berlin, pp 156–170
Arias M, Khardon R (2002) Learning closed Horn expressions. Info Comput 178(1):214–240
Birkendorf A, Böker A, Simon HU (2000) Learning deterministic finite automata from smallest counterexamples. SIAM J Discret Math 13(4):465–491
Hellerstein L, Pillaipakkamnatt K, Raghavan VV, Wilkins D (1996) How many queries are needed to learn? J Assoc Comput Mach 43:840–862
Gasarch W, Lee ACY (2008) Inferring answers to queries. J Comput Syst Sci 74(4):490–512
Gasarch W, Smith CH (1992) Learning via queries. J Assoc Comput Mach 39(3):649–674
Ibarra OH, Jiang T (1988) Learning regular languages from counterexamples. In: Proceedings of the first annual workshop on computational learning theory. MIT, Cambridge/Morgan Kaufmann, San Francisco, pp 371–385
Jackson J (1997) An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. J Comput Syst Sci 55(3):414–440
Jain S, Lange S, Zilles S (2007) A general comparison of language learning from examples and from queries. Theor Comput Sci 387(1):51–66
Lange S, Zilles S (2005) Relations between Gold-style learning and query learning. Infor Comput 203:211–237
Littlestone N (1988) Learning quickly when irrelevant attributes abound: A new linear threshold algorithm. Mach Learn 2:285–318
Maass W, Turán G (1992) Lower bound methods and separation results for on-line learning models. Mach Learn 9:107–145
Acknowledgements
Sanjay Jain was supported in part by NUS grant numbers C252-000-087-001, R146-000-181-112, and R252-000-534-112. Frank Stephen was supported in part by NUS grant numbers R146-000-181-112 and R252-000-534-112.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media New York
About this entry
Cite this entry
Jain, S., Stephan, F. (2017). Query-Based Learning. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7687-1_694
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7687-1_694
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7685-7
Online ISBN: 978-1-4899-7687-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering