Learning decision rules for pattern classification under a family of probability measures

IEEE Transactions on Information Theory

Volumn 43, Issue 1, 1997, Pages 154-166

  Kulkarni, Sanjeev R ^a,b   Vidyasagar, Mathukumalli ^a,c  

^a IEEE   (United States)

^b Princeton University   (United States)

^c and Virtual Reality Groups   (India)

Author keywords

Class of distributions; Decision rules; Estimation; Metric entropy; Pac learning; Pattern classification; Uniform consistency; Vc dimension

Indexed keywords

MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBABILITY;

DECISION RULES; DISTRIBUTION CLASSES; METRIC ENTROPY; UNIFORM CONSISTENCY;

PATTERN RECOGNITION;

EID: 0030736447     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.567668     Document Type: Article

References (19)

1. G. M. Benedek and A. Itai, "Learnability with respect to fixed distributions," Theor. Comput. Sci., vol. 86, no. 2, pp. 377-390, 1991.
2. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth, "Learnability and the Vapnik-Chervonenkis dimension," J. Assoc. Comput. Mach., vol. 36, no. 4, pp. 929-965, 1989.
3. V. Castelli and T. M. Cover, "Classification rules in the unknown mixture parameter case: Relative value of labeled and unlabeled samples," in Proc. 1994 IEEE Int. Symp. on Information Theory, 1994, p. 111.
4. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis. New York: Wiley, 1973.
5. R. M. Dudley, "Metric entropy of some classes of sets with differentiable boundaries," J. Approx. Theory, vol. 10, no. 3, pp. 227-236, 1974.
6. _, "Central limit theorems for empirical measures," Ann. Probab., vol. 6, no. 6, pp. 899-929, 1978.
7. _, "A course on empirical processes," Lecture Notes in Mathematics, no. 1097, 1984, pp. 1-142.
8. R. M. Dudley, S. R. Kulkarni, T. J. Richardson, and O. Zeitouni, "A metric entropy bound is not sufficient for learnability," IEEE Trans. Inform. Theory, vol. 40, pp. 883-885, 1994.
9. D. Haussler, "decision theoretic generalizations of the PAC model for neural net and other learning applications," Inform. Comput., vol. 100, pp. 78-150, 1992.
10. L. V. Kantorovich and G. P. Akilov, Functional Analysis, 2nd ed. New York: Pergamon, 1982.
11. M. Kearns and U. Vazirani, Introduction Computational Learning Theory. Cambridge, MA: MIT Press, 1994.
12. A. N. Kolmogorov and V. M. Tihomirov, "∈-entropy and ∈-capacity of sets in functional spaces," Amer. Math. Soc. Transl., vol. 17, pp. 277-364, 1961.
13. S. R. Kulkarni, S. K. Mitter, and J. N. Tsitsiklis, "Active learning using arbitrary binary valued queries," Mach. Learn., vol. 11, pp. 23-35, 1993.
14. D. Pollard, Convergence of Stochastic Processes. New York: Springer-Verlag, 1984.
15. L. G. Valiant, "A theory of the learnable," Commun. Assoc. Comput. Mach., vol. 27, no. 11, pp. 1134-1142, 1984.
16. V. N. Vapnik and A. Ya. Chervonenkis, "On the uniform convergence of relative frequencies to their probabilities," Theory of Prob. and its Appl., vol. 16, no. 2, pp. 264-280, 1971.
17. _, "Necessary and sufficient conditions for the uniform convergence of means to their expectations," Theory of Prob. and its Appl. vol. 26, no. 3, pp. 532-553, 1981.
18. V. N. Vapnik, Estimation of Dependences Based on Empirical Data. New York: Springer-Verlag, 1982.
19. A. Wald, "Note on the consistency of the maximum likelihood estimate," Ann. Math. Statist., vol. 20, no. 4, pp. 595-601, 1949.