Sample Compression, Learnability, and the Vapnik-Chervonenkis Dimension

ISSN： 0885-6125

Source： Machine Learning, Vol.21, Iss.3, 1995-12, pp. : 269-304

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers

By Goldberg P.W.

Machine Learning, Vol. 18, Iss. 2-3, 1995-02 ,pp. : 131-148

Springer Publishing Company

Access to resources Recommend Favorite

Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions

By Shinohara A.

Theoretical Computer Science, Vol. 137, Iss. 1, 1995-01 ,pp. : 129-144

Elsevier

Access to resources Recommend Favorite

Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension

By Haussler D.

Machine Learning, Vol. 14, Iss. 1, 1994-01 ,pp. : 83-113

Springer Publishing Company

Access to resources Recommend Favorite

The Strength of Weak Learnability

By Schapire R.E.

Machine Learning, Vol. 05, Iss. 2, 1990-06 ,pp. : 197-227

Springer Publishing Company

Access to resources Recommend Favorite

Learnability of quantified formulas

By Dalmau V. Jeavons P.

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 485-511

Elsevier

Access to resources Recommend Favorite