Localization vs. Identification of semi-algebraic sets

Machine Learning

Volumn 32, Issue 3, 1998, Pages 207-224

  Ben David, Shai ^a   Lindenbaum, Michael ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Computer vision; Identification; Learning theory; Localization; PAC; Recognition; Vapnik Chervonenkis dimension

Indexed keywords

CALCULATIONS; COMPUTATIONAL COMPLEXITY; COMPUTER VISION; IDENTIFICATION (CONTROL SYSTEMS); LEARNING SYSTEMS; OBJECT RECOGNITION; RANDOM PROCESSES; ROBOTICS; SET THEORY; ALGEBRA; COMPUTATIONAL GEOMETRY; ROBOT LEARNING;

LEARNING THEORY; LOCALIZATION; PAC; RECOGNITION; VAPNIK-CHERVONENKIS DIMENSIONS; VAPNIK-CHERVONENSKIS DIMENSION;

LINEAR ALGEBRA; COMPUTER VISION;

EID: 0032156420     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007447530834     Document Type: Article

References (14)

1. Ben-David, S., & Lindenbaum, M. (1993). Localization vs. identification of semi-algebraic sets. Proc. of COLT93 (pp. 327-336). ACM Press.
2. Benedek, G.M., & Itai, A. (1988). Learnability by fixed distributions. Proc. of COLT88 (pp. 80-90). Theoretical Computer Science (to appear).
3. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M.K. (1989). Learnability and the Vapnik-Chervonenkis dimension. JACM, 36(4), 929-965.
4. Cover, T.M. (1965). Geometrical and statistical properties of systems of linear equations with applications in pattern recognition. IEEE Trans. Electron. Comput., 326-334.
5. Dudley, R.M. (1984). A course on empirical processes. Lecture Notes in Mathematics, 1097, 2-142.
6. Goldberg, P.W. (1992). PAC-learning geometrical figures, Ph.D. thesis, Department of Computer Science, University of Edinburgh, UK.
7. Goldberg, P., & Jerrum, M. (1995). Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers. Machine Learning, 18, 131-148.
8. Keren, D., Cooper, D., & Subrahmonia, J. (1992). Describing complicated objects by implicit polynomials. IEEE Transaction on Patt. Anal. Mach. Intell. (accepted for publication).
9. Kolmogorov, A.N., & Tichomirov, V.M. (1961). ε-entropy and ε-capacity of sets in functional spaces. Amer. Amth. Soc. Translations (Ser. 2), 17, 277-364.
10. Lindenbaum, M. (1995). Bounds on shape recognition performance. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-17(7), 666-680.
11. Milnor, J. (1964). On the Betti numbers of real varieties. Proc. Amer. Math. Soc., 15, 275-280.
12. Pach, J., & Woeginger, G. (1990). Some new bounds on ε-nets. Proc. 6th Int. Symp. on Comp. Geometry (pp. 10-15).
13. Sauer, N. (1972). On the density of family of sets. Journal of Combinatorial Theory (Series A), 13, 145-147.
14. Terzopoulos, D., Platt, J., Barr A., & Fleischer, K. (1987). Elastically deformable models. ACM Computer Graphics, 21, 205-214.