PAC learning of concept classes through the boundaries of their items
From MaRDI portal
Publication:1392018
DOI10.1016/S0304-3975(95)00240-5zbMath0903.68153MaRDI QIDQ1392018
S. Chiaravalli, Bruno Apolloni
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (3)
\(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration ⋮ Playing monotone games to understand learning behaviors ⋮ Gaining degrees of freedom in subsymbolic learning
Cites Work
- Unnamed Item
- Unnamed Item
- Some special Vapnik-Chervonenkis classes
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- A general lower bound on the number of examples needed for learning
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- A formal theory of inductive inference. Part II
- Non-Parametric Estimation II. Statistically Equivalent Blocks and Tolerance Regions--The Continuous Case
- Nonparametric Estimation, III. Statistically Equivalent Blocks and Multivariate Tolerance Regions--The Discontinuous Case
This page was built for publication: PAC learning of concept classes through the boundaries of their items
