Machine Learning with Data Dependent Hypothesis Classes

Journal of Machine Learning Research

Volumn 2, Issue 3, 2002, Pages 335-358

  Cannon, Adam ^a   Ettinger, J Mark ^b   Hush, Don ^b   Scovel, Clint ^b  

^a Columbia University ^*  (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Classification; Computational Learning Theory; Empirical Process Theory; Shatter Coefficient; Structural Risk Minimization

Indexed keywords

EID: 0001161118     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244302760200650     Document Type: Article

References (30)

1. R.V. Ambartzumian. Factorization Calculus and Geometric Probability. Cambridge University Press, Cambridge, 1990.
2. R.B. Ash. Real Analysis and Probability. Academic Press, New York, 1972.
3. P.L. Bartlett, S. Boucheron, and G. Lugosi. Model selection and error estimation. preprint, 2000. (A shorter version of this paper was apparently presented at COLT 2000.).
4. S. Boucheron, G. Lugosi, and P. Massart. A sharp inequality with applications. Random Structures and Algorithms, 16:277-292, 2000.
5. K. Buescher and P. Kumar. Learning by canonical smooth estimation, part ii: Learning and choice of model complexity. IEEE Transactions on Automatic Control, 41:557-569, 1996.
6. A.H. Cannon and L.J. Cowen. Approximation algorithms for the class cover problem. In Proceedings of the 6th International Symposium on Mathematics and Artificial Intelligence, 2000.
7. C. Cortes and V. Vapnik. Support-vector networks. Machine Learning, 20:273-297, 1995.
8. T. Cover. Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition. IEEE Transactions on Electronic Computers, 14:326-334, 1965.
9. N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, Cambridge, 2000.
10. L. Devroye. Automatic pattern recognition: A study of the probability of error. IEEE Transactions on Pattern Recognition and Machine Intelligence, 10(4):530-543, 1988.
11. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag, 1996.
12. R.M. Dudley. Uniform Central Limit Theorems. Cambridge University Press, New York, 1999.
13. Y. Freund. Self bounding learning algorithms. In COLT; Proceedings of the Workshop on Computational Learning Theory. Morgan Kaufmann, 1998.
14. Y. Gat. A bound concerning the generalization ability of a certain class of learning algorithms. Technical Report 548, University of California, Berkeley, 1999.
15. Dorit S. Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1997.
16. D. Hush and C. Scovel. On the vc dimension of bounded margin classifiers. Machine Learning, 45:33-44, 2001.
17. D.S. Johnson and F.P. Preparata. The densest hemisphere problem. Theoretical Computer Science, 6:93-107, 1978.
18. V.I. Koltchinskii. Rademacher penalties and structural risk minimization. IEEE Transactions on Information Theory, 47(5):1902-1914, 2001.
19. V.I. Koltchinskii, C.T. Abdallah, M. Ariola, P. Dorato, and D. Panchenko. Improved sample complexity estimates for statistical learning control of uncertain systems. IEEE Transactions on Automatic Control, 45(12):2383-2388, 2000.
20. D.J. Marchette and C.E. Priebe. Characterizing the scale dimension of a high dimensional classification problem. Pattern Recognition, forthcoming.
21. C.E. Priebe, J.G. DeVinney, and D.J. Marchette. On the distribution of the domination number for random class cover catch digraphs. Statistics and Probability Letters, 55(3): 239-246, 2001.
22. L.C.G. Rogers. The probability that two samples in the plane have disjoint convex hulls. Journal of Applied Probability, 15:790-802, 1978.
23. B. Schölkopf. The kernel trick for distances. Advances in Neural Information Processing Systems, 13:301-307, 2001. Editors: T.K. Leen, T.G. Dietterich, and V. Tresp.
24. R. J. Serfling. Probability inequalities for the sum in sampling without replacement. Annals of Statistics, 2(1):39-48, 1974.
25. J. Shawe-Taylor, P.L. Bartlett, R.C. Williamson, and M. Anthony. Structural risk minimization over data-dependent hierarchies. IEEE Transactions on Information Theory, 44(5):1926-1940, 1998. Also appeared in NeuroCOLT Technical Report, NC-TR-96-053, 1996.
26. J. Shawe-Taylor, P.L. Bartlett, R.C. Williamson, and M. Anthony. Structural risk minimization over data-dependent hierarchies. IEEE Transactions on Information Theory, 44(5):1926-1940, 1998. Also appeared in NeuroCOLT Technical Report, NC-TR-96-053, 1996.
27. J. Shawe-Taylor and N. Cristianini. On the generalization of soft margin algorithms. Technical Report NC2-TR-2000-082, NeuroCOLT2 Technical Report Series, 2000.
28. A.N. Shiryaev. Probability. Springer-Verlag, New York, 1980.
29. V.N. Vapnik. Statistical Learning Theory. John Wiley and Sons, Inc., New York, 1998.
30. G. Young and A.S. Householder. Discussion of a set of points in terms of their mutual distances. Psychometrika, 3:19-22, 1938.