文章基本信息

标题：A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries
本地全文：下载
作者：Nader H. Bshouty
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：1995
卷号：1995
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We present a 2O(n) time exact learning algorithm for polynomial size DNF using equivalence queries only. In particular, DNF is PAC-learnable in subexponential time under any distribution. This is the first subexponential time PAC-learning algorithm for DNF under any distribution.