
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S.R. Kulkarni, S.K. Mitter, J.N. Tsitsiklis, O. Zeitouni, "PAC Learning with Generalized Samples and an Applicaiton to Stochastic Geometry," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 933942, September, 1993.  
BibTex  x  
@article{ 10.1109/34.232080, author = {S.R. Kulkarni and S.K. Mitter and J.N. Tsitsiklis and O. Zeitouni}, title = {PAC Learning with Generalized Samples and an Applicaiton to Stochastic Geometry}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {15}, number = {9}, issn = {01628828}, year = {1993}, pages = {933942}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.232080}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  PAC Learning with Generalized Samples and an Applicaiton to Stochastic Geometry IS  9 SN  01628828 SP933 EP942 EPD  933942 A1  S.R. Kulkarni, A1  S.K. Mitter, A1  J.N. Tsitsiklis, A1  O. Zeitouni, PY  1993 KW  probably approximately correct learning; PAC learning; generalized samples; stochastic geometry; signal processing; geometric reconstruction; sample size bounds; curve reconstruction; geometry; learning systems; signal processing; stochastic processes VL  15 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
An extension of the standard probably approximately correct (PAC) learning model that allows the use of generalized samples is introduced. A generalized sample is viewed as a pair consisting of a functional on the concept class together with the value obtained by the functional operating on the unknown concept. It appears that this model can be applied to a number of problems in signal processing and geometric reconstruction to provide sample size bounds under a PAC criterion. A specific application of the generalized model to a problem of curve reconstruction is considered, and some connections with a result from stochastic geometry are discussed.
[1] N. Abe and M. K. Warmuth, "On the computational complexity of approximating distributions by probabilistic automata," inProc. Third Ann. Workshop Comput. Learning Theory, 1990, pp. 5266.
[2] A. D. Alexandrov and Yu. G. Reshetnyak,General Theory of Irregular Curves, Mathematics and Its Applications (Soviet series). Boston: Kluwer, 1989, vol. 29.
[3] A. J. Baddeley, "Stochastic geometry and image analysis," inCWI Monographs. Amsterdam: North Holland, 1986.
[4] G. M. Benedek and A. Itai, "Learnability by fixed distributions," inProc. First Workshop Computat. Learning Theory, 1988, pp. 8090.
[5] A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth, "Classifying learnable geometric concepts with the VapnikChervonenkis dimension," inProc. 18th ACM Symp. Theory Comput.(Berkeley, CA), 1986, pp. 273282.
[6] R. M. Dudley, "Central limit theorems for empirical measures,"Ann. Probab., vol. 6, pp. 899929, 1978.
[7] D. Haussler, "Decision theoretic generalizations of the PAC learning model for neural net and other learning applications,"Inform. Comput., vol. 100, pp. 78150, 1992.
[8] W. C. Karl, "Reconstructing objects from projections," Ph.D. thesis, Dept. of EECS, Mass. Inst. of Technol., Feb. 1991.
[9] S. R. Kulkarni, "On metric entropy, VapnikChervonenkis dimension and learnability for a class of distributions," Cent. for Intell. Contr. Syst. Rep. CICSP160, Mass. Inst. of Technol., 1989.
[10] S. R. Kulkarni, "Problems of computational and information complexity in machine vision and learning," Ph.D. thesis, Dept. of Elect. Eng. Comput. Sci., Mass. Inst. of Technol., June 1991.
[11] A. S. Lele, S. R. Kulkarni, and A. S. Willsky, "Convex set estimation from support line measurements and applications to target reconstruction from laser radar data," inSPIE Proc. Laser Radar V, 1990, pp. 5882, vol. 1222 (submitted toJ. Opt. Soc. Amer.).
[12] P. A. P. Moran, "Measuring the length of a curve,"Biometrika, vol. 53, pp. 359364, 1966.
[13] D. Pollard,Convergence of Stochastic Processes. New York: SpringerVerlag, 1984.
[14] J. L. Prince and A. S. Willsky, "Estimating convex sets from noisy support line measurements,"IEEE Trans. Patt. Anal. Machine Intell., vol. 12, pp. 377389, 1990.
[15] T. J. Richardson, forthcoming, 1992.
[16] L. A. Santalo, "Integral geometry and geometric probability,"Encyclopedia of Mathematics and its Applications. Reading, MA: AddisonWesley, 1976, vol. 1.
[17] S. Sherman, "A comparison of linear measures in the plane,"Duke Math. J., vol. 9, pp. 19, 1942.
[18] S. S. Skiena, "Geometric probing," Ph.D. thesis, Dept. of Comput. Sci., Univ. of Illinois, UrbanaChampaign, Rep. no. UIUCDCSR881425, Apr. 1988.
[19] H. Steinhaus, "Length, shape, and area,"Colloquium Mathematicum, vol. 3, pp. 113, 1954.
[20] L. G. Valiant, "A theory of the learnable,"Comm. ACM, vol. 27, pp. 11341142, Nov. 1984.
[21] V. N. Vapnik and A. Ya. Chervonenkis, "On the uniform convergence of relative frequencies to their probabilities,"Theory Probab. Applications, vol. 16, no. 2, pp. 264280, 1971.
[22] V. N. Vapnik and A. Ya. Chervonenkis, "On the uniform convergence of relative frequencies to their probabilities,"Theory Probab. Applications, vol. 16, no. 2, pp. 264280, 1971.
[23] V. N. Vapnik,Estimation of Dependencies Based on Empirical Data. Berlin: SpringerVerlag, 1982.
[24] G. Wahba, "Spline models for observational data," inSeries in Applied Mathematics. New York: SIAM, 1990, vol. 59.