Author： Najarian Kayvan
Publisher： Springer Publishing Company
ISSN： 0925-9902
Source： Journal of Intelligent Information Systems, Vol.25, Iss.3, 2005-11, pp. : 275-291
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
Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Access to resources
Recommend
By Bshouty N.H. Eiron N. Kushilevitz E.
Theoretical Computer Science, Vol. 288, Iss. 2, 2002-10 ,pp. :
PAC Learning of One-Dimensional Patterns
Machine Learning, Vol. 25, Iss. 1, 1996-10 ,pp. :
PAC-learning from general examples
By Fischer P. Hoffgen K.-U. Lefmann H.
Theoretical Computer Science, Vol. 172, Iss. 1, 1997-02 ,pp. :
Learning mixtures of point distribution models with the EM algorithm
By Al-Shaher A.A. Hancock E.R.
Pattern Recognition, Vol. 36, Iss. 12, 2003-12 ,pp. :