Author： Apolloni B. Chiaravalli S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.172, Iss.1, 1997-02, pp. : 91-120
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A new PAC bound for intersection-closed concept classes
By Auer Peter
Machine Learning, Vol. 66, Iss. 2-3, 2007-03 ,pp. :
Access to resources
Recommend
Learning Nested Differences of Intersection-Closed Concept Classes
By Helmbold D.
Machine Learning, Vol. 05, Iss. 2, 1990-06 ,pp. :
By Bshouty N.H. Eiron N. Kushilevitz E.
Theoretical Computer Science, Vol. 288, Iss. 2, 2002-10 ,pp. :
P-sufficient statistics for PAC learning k-term-DNF formulas through enumeration
Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. :