-
1
-
-
0016355478
-
A new look at the statistical model identification
-
H. Akaike, "A new look at the statistical model identification," IEEE Trans. Automat. Contr., vol. AC-19, pp. 716-723, 1974.
-
(1974)
IEEE Trans. Automat. Contr.
, vol.AC-19
, pp. 716-723
-
-
Akaike, H.1
-
2
-
-
0003757634
-
Logically smooth density estimation
-
Dept. of Statistics, Stanford Univ., Stanford, CA
-
A. R. Barron, "Logically smooth density estimation," Tech. Rep. TR 56, Dept. of Statistics, Stanford Univ., Stanford, CA, 1985.
-
(1985)
Tech. Rep. TR 56
-
-
Barron, A.R.1
-
3
-
-
0001347323
-
Complexity regularization with application to artificial neural networks
-
G. Roussas, Ed., (NATO ASI ser.). Dordrecht, The Netherlands: Kluwer
-
_, "Complexity regularization with application to artificial neural networks," in G. Roussas, Ed., Nonparametric functional Estimation and Related Topics (NATO ASI ser.). Dordrecht, The Netherlands: Kluwer, 1991.
-
(1991)
Nonparametric Functional Estimation and Related Topics
-
-
-
4
-
-
0026190366
-
Minimum complexity density estimation
-
A. R. Barron and T. M. Cover, "Minimum complexity density estimation," IEEE Trans. Inform. Theory, vol. 37, pp. 1034-1054, 1991.
-
(1991)
IEEE Trans. Inform. Theory
, vol.37
, pp. 1034-1054
-
-
Barron, A.R.1
Cover, T.M.2
-
6
-
-
0024750852
-
Learnability and the Vapnik-Chervonenkis dimension
-
A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, "Learnability and the Vapnik-Chervonenkis dimension," J. ACM, vol. 36, pp. 929-965, 1989.
-
(1989)
J. ACM
, vol.36
, pp. 929-965
-
-
Blumer, A.1
Ehrenfeucht, A.2
Haussler, D.3
Warmuth, M.K.4
-
8
-
-
33747732724
-
Learning by canonical smooth estimation, Part II: Learning and choice of model complexity
-
[81 K. L. Buescher and P. R. Kumar, "Learning by canonical smooth estimation, Part II: Learning and choice of model complexity," to appear in IEEE Trans. Automat. Contr., 1995.
-
(1995)
IEEE Trans. Automat. Contr.
-
-
Buescher, K.L.1
Kumar, P.R.2
-
9
-
-
0020098693
-
Any discrimination rule can have an arbitrarily bad probability of error for finite sample size
-
L. Devroye, "Any discrimination rule can have an arbitrarily bad probability of error for finite sample size," IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-4, pp. 154-157, 1982.
-
(1982)
IEEE Trans. Pattern Anal. Machine Intell.
, vol.PAMI-4
, pp. 154-157
-
-
Devroye, L.1
-
10
-
-
0002457759
-
Bounds for the uniform deviation of empirical measures
-
_, "Bounds for the uniform deviation of empirical measures," J. Multivariate Anal, vol. 12, pp. 72-79, 1982.
-
(1982)
J. Multivariate Anal
, vol.12
, pp. 72-79
-
-
-
11
-
-
0024053797
-
Automatic pattern recognition: A study of the probability of error
-
_, "Automatic pattern recognition: A study of the probability of error," IEEE Trans. Pattern Anal. Machine Intell., vol. 10, pp. 530-543, 1988.
-
(1988)
IEEE Trans. Pattern Anal. Machine Intell.
, vol.10
, pp. 530-543
-
-
-
12
-
-
0029342607
-
Lower bounds in pattern recognition and learning
-
to appear
-
L. Devroye and G. Lugosi, "Lower bounds in pattern recognition and learning," Pattern Recogn., 1995, to appear.
-
(1995)
Pattern Recogn.
-
-
Devroye, L.1
Lugosi, G.2
-
13
-
-
0010199331
-
Notiparametric discrimination and density estimation
-
Electronics Res. Ctr., Univ. of Texas, Austin
-
L. Devroye and T. J. Wagner, "Notiparametric discrimination and density estimation," Tech. Rep. 183, Electronics Res. Ctr., Univ. of Texas, Austin, 1976.
-
(1976)
Tech. Rep.
, vol.183
-
-
Devroye, L.1
Wagner, T.J.2
-
14
-
-
0027632576
-
Strong universal consistency of neural network classifiers
-
[141 A. Faragó and G. Lugosi, "Strong universal consistency of neural network classifiers," IEEE Trans. Inform. Theory, vol. 39, pp. 1146-1151, 1993.
-
(1993)
IEEE Trans. Inform. Theory
, vol.39
, pp. 1146-1151
-
-
Faragó, A.1
Lugosi, G.2
-
15
-
-
0024137232
-
Predicting {0, 1} functions from randomly drawn points
-
Los Alamitos, CA: IEEE Computer Soc. Press
-
D. Haussler, N. Littlestone, and M. Warmuth, "Predicting {0, 1} functions from randomly drawn points," in Proc. 29th IEEE Symp. on Foundations of Computer Science. Los Alamitos, CA: IEEE Computer Soc. Press, 1988, pp. 100-109.
-
(1988)
Proc. 29th IEEE Symp. on Foundations of Computer Science
, pp. 100-109
-
-
Haussler, D.1
Littlestone, N.2
Warmuth, M.3
-
16
-
-
0013065395
-
Improved upper bounds for probabilities of uniform deviations
-
G. Lugosi, "Improved upper bounds for probabilities of uniform deviations," Statist. Probability Lett., vol. 25. pp. 71-77, 1995.
-
(1995)
Statist. Probability Lett.
, vol.25
, pp. 71-77
-
-
Lugosi, G.1
-
17
-
-
0001098776
-
A universal prior for integers and estimation by minimum description length
-
J. Rissanen, "A universal prior for integers and estimation by minimum description length," Annals Statist., vol. 11, pp. 416-431, 1983.
-
(1983)
Annals Statist.
, vol.11
, pp. 416-431
-
-
Rissanen, J.1
-
18
-
-
0021466584
-
Universal coding, information, prediction and estimation
-
_, "Universal coding, information, prediction and estimation," IEEE Trans. Inform. Theory, vol. IT-30, pp. 629-636, 1984.
-
(1984)
IEEE Trans. Inform. Theory
, vol.IT-30
, pp. 629-636
-
-
-
19
-
-
0000120766
-
Estimating the dimension of a model
-
G. Schwarz, "Estimating the dimension of a model," Annals Statist., vol. 6, pp. 461-464, 1978.
-
(1978)
Annals Statist.
, vol.6
, pp. 461-464
-
-
Schwarz, G.1
-
20
-
-
0021518106
-
A theory of the learnable
-
L. G. Valiant, "A theory of the learnable," Commun. ACM, vol. 27, pp. 1134-1142, 1984.
-
(1984)
Commun. ACM
, vol.27
, pp. 1134-1142
-
-
Valiant, L.G.1
-
22
-
-
84913705650
-
Inductive principles of the search for empirical dependencies methods based on weak convergence of probability measures
-
_, "Inductive principles of the search for empirical dependencies (methods based on weak convergence of probability measures," in Proc. 2nd Annual Workshop on Computational Learning Theory, 1989, pp. 3-24.
-
(1989)
Proc. 2nd Annual Workshop on Computational Learning Theory
, pp. 3-24
-
-
-
23
-
-
0001024505
-
On the uniform convergence of relative frequencies of events to their probabilities
-
V. N. Vapnik and A. Ya. Chervonenkis, "On the uniform convergence of relative frequencies of events to their probabilities," Theory of Probability and its Applications, vol. 16, pp. 264-280, 1971.
-
(1971)
Theory of Probability and Its Applications
, vol.16
, pp. 264-280
-
-
Vapnik, V.N.1
Chervonenkis, A.Ya.2
-
25
-
-
0005071949
-
-
Berlin: Akademie Verlag
-
German translation: Theorie der Zeichenerkennung. Berlin: Akademie Verlag, 1979.
-
(1979)
Theorie der Zeichenerkennung
-
-
|