Author： Beimel Amos Brenner Hai Kasiviswanathan Shiva Nissim Kobbi
Publisher： Springer Publishing Company
ISSN： 0885-6125
Source： Machine Learning, Vol.94, Iss.3, 2014-03, pp. : 401-437
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Improved Bounds on the Sample Complexity of Learning
By Li Y. Long P.M. Srinivasan A.
Journal of Computer and System Sciences, Vol. 62, Iss. 3, 2001-05 ,pp. :
Access to resources
Recommend
Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
The true sample complexity of active learning
Machine Learning, Vol. 80, Iss. 2-3, 2010-09 ,pp. :
The Sample Complexity of Learning Fixed-Structure Bayesian Networks
By Dasgupta S.
Machine Learning, Vol. 29, Iss. 2-3, 1997-11 ,pp. :