-
1
-
-
0345749537
-
A unified approach to learnability
-
G. Ausiello, D. Bovet and R. Petreschi, eds., World Scientific, Singapore
-
B. Apolloni and G. Mauri, A unified approach to learnability, in: G. Ausiello, D. Bovet and R. Petreschi, eds., in: Proc. 1st Italian Conf. on Algorithms and Complexity (World Scientific, Singapore, 1990) 199-217.
-
(1990)
Proc. 1st Italian Conf. on Algorithms and Complexity
, pp. 199-217
-
-
Apolloni, B.1
Mauri, G.2
-
2
-
-
0346380767
-
PAC Learning is easier than expected
-
L. Di Pace, ed., Roma
-
B. Apolloni and S. Chiaravalli, PAC Learning is easier than expected, in: L. Di Pace, ed., Proc. III GAI*IA workshop on Computational Learning (Roma, 1992) 253-260.
-
(1992)
Proc. III GAI*IA Workshop on Computational Learning
, pp. 253-260
-
-
Apolloni, B.1
Chiaravalli, S.2
-
3
-
-
0004736131
-
Classifying learnable geometrical concepts with the Vapnik-Chervonenkis dimension
-
ACM, Berkeley, CA
-
A. Blumer, A. Ehrenfeucht, D. Haussler and M. Warmuth, Classifying learnable geometrical concepts with the Vapnik-Chervonenkis dimension, in: Proc 18th ACM Symp. on Theory of Computing (ACM, Berkeley, CA, 1986) 273-282.
-
(1986)
Proc 18th ACM Symp. on Theory of Computing
, pp. 273-282
-
-
Blumer, A.1
Ehrenfeucht, A.2
Haussler, D.3
Warmuth, M.4
-
4
-
-
0024750852
-
Learnability and the Vapnik-Chervonenkis dimension
-
A. Blumer, A. Ehrenfeucht, D. Haussler and M. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. ACM 36 (1989) 929-965.
-
(1989)
J. ACM
, vol.36
, pp. 929-965
-
-
Blumer, A.1
Ehrenfeucht, A.2
Haussler, D.3
Warmuth, M.4
-
5
-
-
0024739191
-
A general lower-bound on the number of examples needed for learning
-
A. Ehrenfeucht, D. Haussler, M. Kearns and L.G. Valiant, A general lower-bound on the number of examples needed for learning, Inform. Comput. 82 (1988) 247-251.
-
(1988)
Inform. Comput.
, vol.82
, pp. 247-251
-
-
Ehrenfeucht, A.1
Haussler, D.2
Kearns, M.3
Valiant, L.G.4
-
6
-
-
85087535203
-
On learning boolean functions
-
Ass. Comp. Mach, New York
-
B.K. Natarajan, On learning boolean functions, in: Proc. 19th ACM Symp. Theory of Computing (Ass. Comp. Mach, New York, 1987) 285-295.
-
(1987)
Proc. 19th ACM Symp. Theory of Computing
, pp. 285-295
-
-
Natarajan, B.K.1
-
8
-
-
4544279425
-
A formal theory of inductive inference
-
A. Solomonof, A formal theory of inductive inference, Inform. and Control 7 (1964) 1-22 and 224-254.
-
(1964)
Inform. and Control
, vol.7
, pp. 1-22
-
-
Solomonof, A.1
-
9
-
-
0001038382
-
Nonparametric estimation II. Statistical equivalent blocks and tolerance regions - The continuous case
-
J.W. Tukey, Nonparametric estimation II. Statistical equivalent blocks and tolerance regions - The continuous case, Ann. Math. Statest. 18 (1947) 529-539.
-
(1947)
Ann. Math. Statest.
, vol.18
, pp. 529-539
-
-
Tukey, J.W.1
-
10
-
-
0002138576
-
Nonparametric estimation III. Statistical equivalent blocks and multivariate tolerance regions - The discontinuous case
-
J.W. Tukey, Nonparametric estimation III. Statistical equivalent blocks and multivariate tolerance regions - The discontinuous case, Ann. Math. Statist. 19 (1948) 30-39.
-
(1948)
Ann. Math. Statist.
, vol.19
, pp. 30-39
-
-
Tukey, J.W.1
-
11
-
-
0021518106
-
A theory of the learnable
-
L.G. Valiant, A theory of the learnable, Comm. ACM 27 (1984) 1134-1142.
-
(1984)
Comm. ACM
, vol.27
, pp. 1134-1142
-
-
Valiant, L.G.1
-
13
-
-
0001024505
-
On the uniform convergence of relative frequencies of events to their probabilities
-
V.V. Vapnik and A.Ya. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Prob. Appl. 10 (1971) 264-280.
-
(1971)
Theory Prob. Appl.
, vol.10
, pp. 264-280
-
-
Vapnik, V.V.1
Chervonenkis, A.Ya.2
-
14
-
-
0000392470
-
Some special Vapnick-Chervonenkis classes
-
R.S. Wenecour and R.M. Dudley, Some special Vapnick-Chervonenkis classes, Discrete Math. 33 (1981) 313-318.
-
(1981)
Discrete Math.
, vol.33
, pp. 313-318
-
-
Wenecour, R.S.1
Dudley, R.M.2
|