Occam's razor for functions

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Dana Angluin , Philip Laird, Learning From Noisy Examples, Machine Learning, v.2 n.4, p.343-370, April 1988 [doi>10.1023/A:1022873112823]
	2	Martin Anthony , Norman Biggs, Computational learning theory: an introduction, Cambridge University Press, New York, NY, 1992
	3	Ar, S, Lipton, R, Rubenfeld, R., and Sudan M., (1992). Reconstructing algebraic functions from mixed data, Proc. 33rd IEEE FOCS, pp.503-511.
	4	Michael Ben-Or, A deterministic algorithm for sparse multivariate polynomial interpolation, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.301-309, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62241]
	5	Berlekamp, E., and Welch, L., (1970). Error correction of algebraic block codes, U.S. Patent No. 4,633,470.
	6	Anselm Blumer , A. Ehrenfeucht , David Haussler , Manfred K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, Journal of the ACM (JACM), v.36 n.4, p.929-965, Oct. 1989 [doi>10.1145/76359.76371]
	7	Feller, W, (1957). Intro. to Prob. Theory and its Applications, John WHey, New York.
	8	Dima Yu Grigoriev , Marek Karpinski , Michael F. Singer, Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields, SIAM Journal on Computing, v.19 n.6, p.1059-1063, Dec. 1990 [doi>10.1137/0219073]
	9	Haussler, D., (1989). Generali~ng the PAC model for neural net and other learning applications, Proc. 30th IEEE FOCS, pp. 40-45.
	10	Imai, H., and Iri, M. (1986). An optimal algorithm for approximating a piecewise linear function. J. of Information Processing, Vol. 9, No. 3, pp. 159-162.
	11	Jazwinsld, A.H, (1970). Stochastic Processes and Filtering Theory, Academic Press, New York.
	12	Michael Kearns , Ming Li, Learning in the presence of malicious errors, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.267-280, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62238]
	13	Kearns M, and Schaplre, IL E, (1990). Efficient distribution-free learning of probabilistic concepts, Proc. IEEE FOCS, pp. 382-391.
	14	Krishnan, V, (1984). Non-Linear Filtering and Smoothing, John Wiley, New York.
	15	B. K. Natarajan, On Learning Sets and Functions, Machine Learning, v.4 n.1, p.67-97, October 1989 [doi>10.1023/A:1022605311895]
	16	Balas Kausik Natarajan, Machine learning: a theoretical approach, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991
	17	Natarajan, B.K., (1993). Filtering random noise via data compression, IEEE Data Compression Conference, pp.6049..
	18	Natar~an, B.K, and Ruppert, J, (1992). On sparse approximations to curves and functions. Proc. 4th Canadian Conf. on Comp. Geom., pp.250-257.
	19	Oppenheim, A.V, and Schafer, IL, (1974). Digital Signal Processing, Prentice Hall, Englewood Cliffs, NJ. Papoulis, A. (1965). Probability, Random Variables and Stochastic Processes. McGraw Hill, New York.
	20	Pollard, D., (1984). Convergence of Stochastic Processes, Springer Verlag, New York.
	21	Robert Sloan, Types of noise in data for concept learning, Proceedings of the first annual workshop on Computational learning theory, p.91-96, August 03-05, 1988, MIT, Cambridge, Massachusetts, United States
	22	Suri, S., (1988). On some link distance problems in a simple polygon. IEEE Trans. on Robotics and Automation, Vol.6, No.l, pp.108-113.