Statistical Learning Theory: Models, Concepts, and Results

Handbook of the History of Logic

Volumn 10, Issue , 2011, Pages 651-706

  Luxburg, Ulrike von ^a   Schölkopf, Bernhard ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79957600404     PISSN: 18745857     EISSN: None     Source Type: Book Series    
DOI: 10.1016/B978-0-444-52936-7.50016-1     Document Type: Book

References (36)

1. Anthony M., Biggs N. Computational learning theory 1992, Cambridge University Press.
2. Berger J.O. Statistical Decision theory and Bayesian Analysis 1985, Springer Verlag, New York.
3. Bishop C. Pattern Recognition and Machine Learning 2006, Springer.
4. Boucheron S., Bousquet O., Lugosi G. Theory of classification: A survey of some recent advances. ESAIM: Probability and Statistics 2005, 9:323-375.
5. Bousquet O., Boucheron S., Lugosi G. Introduction to statistical learning theory. Advanced Lectures on Machine Learning 2003, 169-207. Springer, Berlin. O. Bousquet, U. von Luxburg, G. Rätsch (Eds.).
6. Chernoff H. A measure of asymptotic efficiency of tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics 1952, 23:493-507.
7. Corfield D., Schölkopf B., Vapnik V. Popper, Falsification, and the VC-Dimension 2005, Max Planck Institute For Biological Cybernetics, Technical Report TR-145.
8. Cox R.T. The Algebra of Probable Inference 1961, John Hopkins University Press, Baltimore.
9. Cucker F., Zhou D.-X. Learning theory: an approximation theory viewpoint 2007, Cambridge University Press.
10. Devroye L., Györfi L., Lugosi G. A Probabilistic Theory of Pattern Recognition 1996, Springer, New York.
11. Grünwald P. The minimum description length principle 2007, MIT Press, Cambridge, MA.
12. Herbrich R., Williamson R.C. Learning and generalization: Theoretical bounds. Handbook of Brain Theory and Neural Networks 2002, M. Arbib (Ed.).
13. Ho Y.C., Pepyne D.L. Simple explanation of the no-free-lunch theorem and its implications. Journal of Optimization Theory and Applications 2002, 115(3):549-570.
14. Hoeffding W. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 1963, 58:13-30.
15. Jaynes E.T. Probability Theory - The Logic of Science 2003, Cambridge University Press, Cambridge.
16. Kearns M., Vazirani U. An introduction to computational learning theory 1994, MIT Press, Cambridge, Massachusetts.
17. Kiefer J. Conditional confidence statements and confidence estimators. Journal of the American Statistical Association 1977, 72(360):789-808.
18. Mendelson S. A few notes on statistical learning theory. Advanced lectures in machine learning, volume LNCS 2600 2003, 1-40. Springer.
19. Nobel A. Limits to classification and regression estimation from ergodic processes. The Annals of Statistics 1999, 27(1):262-273.
20. O'Hagan A. Bayesian Inference, volume 2B of Kendall's Advanced Thoery of Statistics 1994, Arnold, London.
21. Popper K. The logic of scientific discovery (Hutchinson, translation of "Logik der Forschung", 1934) 1959.
22. Rissanen J. Information and complexity in statistical modeling 2007, Springer, New York.
23. Sauer N. On the density of families of sets. J. Combinatorial Theory (A) 1972, 13:145-147.
24. Schölkopf B., Smola A. Learning with Kernels 2002, MIT Press, Cambridge, MA.
25. Shawe-Taylor J., Bartlett P., Williamson R., Anthony M. Structural risk minimization over data-dependent hierarchies. IEEE Transactions on Information Theory 1998, 44(5):1926-1940.
26. Shelah S. A combinatorial problem: stability and orders for models and theories in infinitariy languages. Pacific Journal of Mathematics 1972, 41:247-261.
27. Steinwart I., Hush D., Scovel C. Learning from dependent observations 2006, Los Alamos National Laboratory, Technical Report LA-UR-06-3507.
28. Steinwart I. Consistency of support vector machines and other regularized kernel classifiers. IEEE Transactions on Information Theory 2005, 51(1):128-142.
29. Stone C.J. Consistent nonparametric regression (with discussion). Annals of Statistics 1977, 5:595-645.
30. Tipping M. Bayesian inference: An introduction to principles and practice in machine learning. Advanced Lectures on Machine Learning 2003, 41-62. Springer. O. Bousquet, U. von Luxburg, G. Rätsch (Eds.).
31. Vapnik V., Chervonenkis A. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications 1971, 16:264-280.
32. Vapnik V., Chervonenkis A. The necessary and sufficient conditions for the uniform convergence of averages to their expected values. Teoriya Veroyatnostei i Ee Primeneniya 1981, 26(3):543-564.
33. Vapnik V. The Nature of Statistical Learning Theory 1995, Springer Verlag, New York.
34. Vapnik V. Statistical Learning Theory 1998, Wiley, New York.
35. Wolpert D., Macready W.G. No free lunch theorems for optimization. IEEE Trans. Evolutionary Computation 1997, 1(1):67-82.
36. Wolpert D. The supervised learning no-free-lunch theorems. Proc. 6th Online World Conf. on Soft Computing in Industrial Applications 2001.