Abstract
This paper is concerned with the model of learning with equivalence-queries which was introduced by Angluin in [2]. We show that decision lists and decision trees of bounded rank are polynomially learnable in this model. If there are N base functions, then N 2 queries are sufficient for learning lists. For learning trees of rank r, (1+o(1))N 2r queries are sufficient. We also investigate the problem of learning a shortest representation of a target decision list. Let k-DL denote the class of decision lists with boolean terms of maximal length k as base functions. We show that shortest representations for lists from 1-DL can be learned efficiently. The corresponding questions for k≥2 are open, although we are able to show some related (but weaker) results. For instance, we present an algorithm which efficiently learns shortest representations of boolean 2-CNF or 2-DNF formulas.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, M. R. Garey, and J. D. Ulman. The transitive reduction of a directed graph. SIAM Journal on Computing, 1(2):131–137, 1972.
Dana Angluin. Queries and concept learning. Machine Learning, 2(4):319–342, 1988.
Avrim Blum. Separating distribution-free and mistake-bound learning models over the boolean domain. In Proceedings of the 31st Symposium on Foundations of Computer Science, pages 211–220, 1990.
Avrim Blum. Rank-r decision trees are a subclass of r-decision lists. Information Processing Letters, 42:183–185, 1992.
Andrzej Ehrenfeucht and David Haussler. Learning decision trees from random examples. Information and Computation, 82(3):231–246, 1989.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
Thomas Hancock, Tao Jiang, Ming Li, and John Tromp. Lower bounds on learning decision lists and trees. Draft.
David Helmbold, Robert Sloan, and Manfred K. Warmuth. Learning nested differences of intersection-closed concept classes. Machine Learning, 5:165–196, 1990.
N. Jones, Y. Lien, and W. Laaser. New problems complete for nondeterministic log space. Math. Systems Theory, 10:1–17, 1976.
Nick Littlestone. Personal Communication.
Nick Littlestone. Learning quickly when irrelevant attributes abound: a new linear threshold algorithm. Machine Learning, 2(4):245–318, 1988.
Kurt Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, volume 2 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, Berlin, 1984.
Ronald Rivest. Learning decision lists. Machine Learning, 2(3):229–246, 1987.
Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134–1142, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simon, H.U. (1995). Learning decision lists and trees with equivalence-queries. In: Vitányi, P. (eds) Computational Learning Theory. EuroCOLT 1995. Lecture Notes in Computer Science, vol 904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59119-2_188
Download citation
DOI: https://doi.org/10.1007/3-540-59119-2_188
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59119-1
Online ISBN: 978-3-540-49195-8
eBook Packages: Springer Book Archive