A. Blum, S. Rudich, "Fast learning of k-term DNF formulas with queries", Proc of the 24th Annual Symposium on Theory of Computing, 1992, pages 382-389. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Learning Unions of Rectangles with Queries - Chen, Homer (2 citations) (Correct)
.... These include monotone DNF formulas in [V] and read twice DNF formulas in [AP] and [H] For learning k term DNF formulas with equivalence queries and membership queries, Angluin [Ab] designed an algorithm whose running time is O(d k 2 ) another remarkable result is due to Blum and Rudich [BR], they exhibited an O(d2 O(k) learning algorithm. Enlightened by those positive results on learning k term DNF formulas with queries, we begin to investigate the efficient learnability of unions of k rectangles, a general class of k term DNF formulas. We say a concept is a tree if it is a ....
....as the hypothesis space. Finally, since U k BOX d n is a general case of k term DNF formulas with at most d variables, it would be very interesting to investigate whether one can design an efficient algorithm for learning U O(log d) BOX d n by extending Blum and Rudich s technique developed in [BR] for learning O(log n) term DNF formulas. Acknowledgment We would like to thank Wolfgang Maass and Ming Li for their discussions. We would also like to thank Avrim Blum for explaining the algorithm developed in [BR] to us, Anselm Blumer for his critiques on the draft of this paper, and Phil Long ....
[Article contains additional citation context not shown here]
A. Blum, S. Rudich, "Fast learning of k-term DNF formulas with queries", Proc of the 24th Annual Symposium on Theory of Computing, 1992, pages 382-389.
A Quantum Computational Learning Algorithm - Ventura, Martinez (1998) (Correct)
.... Until recently, DNF as a general function class has resisted all 3 attempts to find an algorithm that will learn it in the PAC sense; however, much work has been done regarding its learnability, and some encouraging results have been obtained for restricted subclasses of DNF [Aiz91] [Blu92] [Bsh93] Kea87] Currently, a particularly promising approach to the unrestricted class DNF is the use of discrete Fourier analysis in the development of machine learning algorithms, including work by Goldreich and Levin [Gol89] Kushilevitz and Mansour [Kus93] and Jackson [Jac94] Jackson s ....
Blum, A. and S. Rudich, "Fast Learning of k-term DNF formulas with Queries", Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 3829, 1992.
Learning Unions of Rectangles with Queries - Chen, Homer (1993) (2 citations) (Correct)
No context found.
A. Blum, S. Rudich, "Fast learning of k-term DNF formulas with queries", Proc of the 24th Annual Symposium on Theory of Computing, 1992, pages 382-389.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC