On the impact of forgetting on learning machines

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	F M Ablaev , R Freivalds, Why sometimes probabilistic algorithms can be more effective, Proceedings of the 12th symposium on Mathematical foundations of computer science 1986, p.1-14, June 1986, Bratislava, Czechoslovakia
	2	Foued Ameur , Paul Fischer , Klaus-U. Höffgen , Friedhelm Meyer auf der Heide, Trial and error: a new approach to space-bounded learning, Proceedings of the first European conference on Computational learning theory, p.133-144, October 1994, Royal Holloway, Univ. of London, United Kingdom
	3	John R. Anderson, The Architecture of Cognition, Harvard University Press, Cambridge, MA, 1983
	4	Dana Angluin , Carl H. Smith, Inductive Inference: Theory and Methods, ACM Computing Surveys (CSUR), v.15 n.3, p.237-269, Sept. 1983 [doi>10.1145/356914.356918]
	5	~ANGLUIN, D., AND SMITH, C. H. 1987. Inductive inference. In Encyclopedia of Artificial Intelli- ~gence, S. Shapiro, ed. Wiley, New York, pp. 409-418.
	6	~BAR-HILLEL, V., PERLES, M., AND SHAMIR, E. 1951. On formal properties of simple phrase ~structured grammars. Z. Phon. Sprach., Kommun. 14, 143-172.
	7	~BARZDINS, J. 1974. Two theorems on the limiting synthesis of functions. In Theory of Algorithms ~and Programs, vol. 1. J. Barzdins, ed. Latvian State University, Riga, U.S.S.R., pp. 82-88.
	8	~BLUM, L., AND BLUM, M. 1975. Toward a mathematical theory of inductive inference. Inf. Cont. ~28, 125-155.
	9	Stéphane Boucheron , Jean Sallantin, Some remarks about space-complexity of learning, and circuit complexity of recognizing, Proceedings of the first annual workshop on Computational learning theory, p.125-138, August 03-05, 1988, MIT, Cambridge, Massachusetts, United States
	10	~BR,~NE, M. D. S. 1971. On two types of models of the internalization of grammars. In The ~Ontogenesis of Grammar, D. I. Slobin, ed. Academic Press, Orlando, Fla., pp. 153-186.
	11	CASE,J. 1974 periodicity in generations of automata Math. syst. Theory 8, 15-32.
	12	John Case , Sanjay Jain , Arun Sharma, Vacillatory learning of nearly minimal size grammars, Journal of Computer and System Sciences, v.49 n.2, p.189-207, Oct. 1994 [doi>10.1016/S0022-0000(05)80046-7]
	13	CASE,J., AND NGOMANGUELLE,S. Refinements o finductive inference by popperian machines. ~kybernatica, to apopesr.
	14	~CASE, J., AND SMITH, C. 1983. Comparison of identification criteria for machine inductive ~inference. Theoret. Comput. Sci. 25, 2, 193-220.
	15	~CRICK, F., AND MITCHISON, G. 1983. The function of dream sleep. Nature 304, 14, 111-114.
	16	~FELLER, W. 1968. An Introduction to Probability Theory and Its Applications, vol. 1. Wiley, New ~York.
	17	Sally Floyd, Space-bounded learning and the Vapnik-Chervonenkis dimension, Proceedings of the second annual workshop on Computational learning theory, p.349-364, December 1989, Santa Cruz, California, United States
	18	Rusins Frievalds, Inductive inference of minimal programs, Proceedings of the third annual workshop on Computational learning theory, p.3-22, August 06-08, 1990, Rochester, New York, United States
	19	~FREIVALDS, R., KINBER, E., AND SMITH, C. 1993a. Learning with a limited memory. In Notes of ~the AAAI Spring Symposium on Training Issues in Incremental Learning. Stanford Univ., Stanford, ~Calif., pp. 78-87.
	20	Rūsiņš Freivalds , Efim Kinber , Carl H. Smith, On the impact of forgetting on learning machines, Proceedings of the sixth annual conference on Computational learning theory, p.165-174, July 26-28, 1993, Santa Cruz, California, United States [doi>10.1145/168304.168326]
	21	~FREIVALDS, R., KINBER, E., AND SMITH, C. 1993c. Probabilistic versus deterministic memory- ~limited learning. In Record of the Workshop on Algorithmic Learning for Knowledge Processing.
	22	~FREIVALDS, R., KINBER, E., AND SMITH, C. 1994. Quantifying the amount of relevent informa- ~tion. In Notes of the AAA1 Spring Symposium on Reference, pp. 76-79.
	23	Rusins Freivalds , Carl H. Smith, Memory Limited Inductive Inference Machines, Proceedings of the Third Scandinavian Workshop on Algorithm Theory, p.19-29, July 08-10, 1992
	24	Rūsiņš Freivalds , Carl H. Smith, On the role of procrastination in machine learning, Information and Computation, v.107 n.2, p.237-271, Dec. 1993 [doi>10.1006/inco.1993.1068]
	25	Proceedings of the third annual workshop on Computational learning theory, July 1990
	26	~GOLD, E. M. 1967. Language identification in the limit. Inf. Cont. 10, 447-474.
	27	~GRIFFIN, H. 1954. Elementary Theory of Numbers. McGraw-Hill, New York.
	28	~HAUSSLER, D. 1985. Space efficient learning algorithms. Tech. Rep. UCSC-CLR-88-2. Univ. ~California at Santa Cruz, Santa Cruz, Calif.
	29	Proceedings of the fifth annual workshop on Computational learning theory, July 1992
	30	Proceedings of the first annual workshop on Computational learning theory, December 1988
	31	~HEATH, D., KASlF, S., KOSARAJU, R., SALZBERG, S., AND SULLIVAN, G. 1991. Learning nested ~concept classes with limited storage. In Proceedings of the 12th International Joint Conference on ~An ificial Intelligence (Sydney, Australia). Morgan-Kaufmann, San Mateo, Calif., pp. 777-782.
	32	David Helmbold , Robert Sloan , Manfred K. Warmuth, Learning nested differences of intersection-closed concept classes, Proceedings of the second annual workshop on Computational learning theory, p.41-56, December 1989, Santa Cruz, California, United States
	33	~HOPFIELD, J. J., FEINSTEIN, D. I., AND PALMER, R. G. 1983. 'Unlearning' has a stabilizing effect ~in collective memories. Nature 304, 14, 158-159.
	34	~JANTKE, K. P., AND BEICK, H. R. 1981. Combining postulates of naturalness in inductive ~inference. Electron. Inf. Kyber. 17, 465-484.
	35	~I~EENE, S. 1938. On notation for ordinal numbers. J. Symb. Logic 3, 150-155.
	36	Daniel S. Levine, Introduction to Neural and Cognitive Modeling, Lawrence Erlbaum Associates, Inc., Mahwah, NJ, 1999
	37	Harry R. Lewis , Christos H. Papadimitriou , Christos Papadimitriou, Elements of the Theory of Computation, Prentice Hall PTR, Upper Saddle River, NJ, 1997
	38	Jyh-Han Lin , Jeffrey Scott Vitter, A Theory for Memory-Based Learning, Machine Learning, v.17 n.2-3, p.143-167, Nov./Dec. 1994 [doi>10.1007/BF00993469]
	39	Michael Machtey , Paul Young, An Introduction to the General Theory of Algorithms, Elsevier Science Inc., New York, NY, 1978
	40	~MIClq{ALSrd, R., CARBONELL, J., AND MITCHELL, T. 1983. Machine Learning. Tioga Publishing Co., ~Palo Alto, Calif.
	41	~MILLER, G. 1956. The magical number seven plus or minus two. Psych. Rev. 63, 8~-97.
	42	~MIYA~ARA, T. 1987. Inductive inference by iteratively working and consistent strategies 'with ~anomalies. Bull. Inf. Cybern. 22, 171-177.
	43	~MIY.4~ARA, T. 1989. A note on iteratively working strategies in inductive inference. In Proceed- ~ings of the Fujitsu IIAS-S1S Workshop on Computational Learning Theory (Numazu, Japan).
	44	~OSHERSON, D., STOB, M., AND WEINSTEIN, S. 1986. Systems that Learn. MIT Press, Cambridge, ~Mass.
	45	L. Pitt, Probabilistic inductive inference, Journal of the ACM (JACM), v.36 n.2, p.383-433, April 1989 [doi>10.1145/62044.62053]
	46	Leonard Pitt , Carl H. Smith, Probability and plurality for aggregations of learning machines, Information and Computation, v.77 n.1, p.77-92, April 1988 [doi>10.1016/0890-5401(88)90046-6]
	47	~POPPER, K. 1968. The Logic of Scientific Discovery. Harper Torch Books, New York.
	48	Proceedings of the second annual workshop on Computational learning theory, December 1989
	49	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	50	Paul S. Rosenbloom , John E. Laird , Allen Newell , Robert McCarl, A preliminary analysis of the Soar architecture as a basis for general intelligence, Artificial Intelligence, v.47 n.1-3, p.289-325, Jan. 1991 [doi>10.1016/0004-3702(91)90057-Q]
	51	Robert E. Schapire, The Strength of Weak Learnability, Machine Learning, v.5 n.2, p.197-227, Jun. 1990 [doi>10.1023/A:1022648800760]
	52	~SERVAN-SCHRE1BER, g. 199l. The Competitive Chunking Theory: Models of Preception, Learning, ~and Memory. Ph.D. dissertation. Department of Psychology, Carnegie Mellon Univ., Pittsburgh, ~Pa.
	53	Stuart C. Shapiro, Encyclopedia of artificial intelligence; vols. 1 and 2, Wiley-Interscience, New York, NY, 1987
	54	Hava T. Siegelmann , Eduardo D. Sontag, On the computational power of neural nets, Proceedings of the fifth annual workshop on Computational learning theory, p.440-449, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130432]
	55	~SMULLYAN, R. 1961. Theory of Formal Systems, Annals of Mathematical Studies, vol. 47. Princeton ~University Press, Princeton, N.J.
	56	~TAIMINA, D. YA., AND FREIVALDS, R. 1966. On complexity of probabilistic finite automata ~recognizing superlanguages. In Methods of Logic in Construction of Effective Algorithms. Kalinin ~State Univ., Tver, pp. 92-96.
	57	L. G. Valiant, A theory of the learnable, Communications of the ACM, v.27 n.11, p.1134-1142, Nov. 1984 [doi>10.1145/1968.1972]
	58	Proceedings of the fourth annual workshop on Computational learning theory, August 1991
	59	~WEXLER, K., AND CUL~COVER, P. W. 1980. Formal Principles of Language Acquisition. The MIT ~Press, Cambridge, Mass.
	60	~wEIHAGEN, R. 1976. Limes-erkennung rekursiver funktionen durch spezielle strategien. Elek. ~Inf. Kyber. 12, 93-99.