Efficient distribution-free learning of probabilistic concepts
type: Item
instance of: scholarly article
title: Efficient distribution-free learning of probabilistic concepts
zbMATH Open document ID: 0822.68093
DOI: 10.1016/S0022-0000(05)80062-5
author: Michael Kearns
author: Robert E. Schapire
published in: Journal of Computer and System Sciences
publication date: 1995-10-09T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 598085
zbMATH Keywords: machine learning
zbMATH Keywords: probabilistic concepts
MaRDI profile type: Publication
cites work: Q3138964
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: Occam's razor
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Q3619797
cites work: Q3997330
cites work: Q4403756
cites work: Central limit theorems for empirical measures
cites work: Q4013556
cites work: Decision theoretic generalizations of the PAC model for neural net and other learning applications
cites work: Equivalence of models for polynomial learnability
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Q3345798
cites work: Toward efficient agnostic learning
cites work: Computational limitations on learning from examples
cites work: Convergence of stochastic processes
cites work: A theory of the learnable
cites work: Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
cites work: A learning criterion for stochastic rules
cites work: Fuzzy sets
description: scientific article; zbMATH DE number 598085