This is a preview of subscription content, log in via an institution to check access.
Recommended Reading
Aizenstein, H., Hellerstein, L., & Pitt, L. (1995). 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 October 1992 (pp. 523–532). Washington, DC: IEEE Computer Society.
Aizenstein, H., & Pitt, L. (1995). On the learnability of disjunctive normal form formulas. Machine Learning, 19(3), 183–208.
Angluin, D. (1987). Learning regular sets from queries and counterexamples. Information and Computation, 75(2), 87–106.
Angluin, D. (1988). Queries and concept learning. Machine Learning, 2(4), 319–342.
Angluin, D. (1990). Negative results for equivalence queries. Machine Learning, 5, 121–150.
Angluin, D. (2004). Queries revisited. Theoretical Computer Science, 313, 175–194.
Angluin, D., Frazier, M., & Pitt, L. (1992). Learning conjunctions of Horn clauses. Machine Learning, 9, 147–164.
Angluin, D., Hellerstein, L., & Karpinski, M. (1993). Learning read-once formulas with queries. Journal of the Association for Computing Machinery, 40, 185–210.
Arias, M. (2004). Exact learning of first-order Horn expressions from queries. Ph.D. Thesis, Tufts University.
Arias, M., & Balcázar, J. L. (2009). Canonical Horn representations and query learning. Algorithmic learning theory: Twentieth international conference ALT 2009, LNAI (Vol. 5809, pp. 156–170). Berlin: Springer.
Arias, M., & Khardon, R. (2002). Learning closed Horn expressions. Information and Computation, 178(1), 214–240.
Birkendorf, A., Böker, A., & Simon, H. U. (2000). Learning deterministic finite automata from smallest counterexamples. SIAM Journal on Discrete Mathematics, 13(4), 465–491.
Hellerstein, L., Pillaipakkamnatt, K., Raghavan, V. V., & Wilkins, D. (1996). How many queries are needed to learn? Journal of the Association for Computing Machinery, 43, 840–862.
Gasarch, W., & Lee, A. C. Y. (2008). Inferring answers to queries. Journal of Computer and System Sciences, 74(4), 490–512.
Gasarch, W., & Smith, C. H. (1992). Learning via queries. Journal of the Association for Computing Machinery, 39(3), 649–674.
Ibarra, O. H., & Jiang, T. (1988). Learning regular languages from counterexamples. In Proceedings of the first annual workshop on computational learning theory, MIT, Cambridge (pp. 371–385). San Francisco: Morgan Kaufmann.
Jackson, J. (1997). An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences, 55(3), 414–440.
Jain, S., Lange, S., & Zilles, S. (2007). A general comparison of language learning from examples and from queries. Theoretical Computer Science, 387(1), 51–66.
Lange, S., & Zilles, S. (2005). Relations between Gold-style learning and query learning. Information and Computation, 203, 211–237.
Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linear threshold algorithm. Machine Learning, 2, 285–318.
Maass, W., & Turán, G. (1992). Lower bound methods and separation results for on-line learning models. Machine Learning, 9, 107–145.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Jain, S., Stephan, F. (2011). Query-Based Learning. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30164-8_688
Download citation
DOI: https://doi.org/10.1007/978-0-387-30164-8_688
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30768-8
Online ISBN: 978-0-387-30164-8
eBook Packages: Computer ScienceReference Module Computer Science and Engineering