On learning multiple concepts in parallel

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On learning multiple concepts in parallel

Full text

Pdf (704 KB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the sixth annual conference on Computational learning theory table of contents

Santa Cruz, California, United States

Pages: 175 - 181

Year of Publication: 1993

ISBN:0-89791-611-5

Authors

Efim Kinber
Carl H. Smith
Mahendran Velauthapillai
Rolf Wiehagen

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 15, Downloads (12 Months): 27, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/168304.168328 What is a DOI?

REFERENCES

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.

	AGS89	Dana Angluin , William I. Gasarch , Carl H. Smith, Training sequences, Theoretical Computer Science, v.66 n.3, p.255-272, 26 Aug. 1989 [doi>10.1016/0304-3975(89)90153-9]
	Bar74	J. Barzdins. Two theorems on the limiting synthesis of functions. In Barzdins, editor, Theory of Algorithms and Programs, volume 1, pages 82-88. Latvian State University, Riga, U.S.S.R., 1974.
	BB75	L. Blum and M. Blum. Toward a mathematical theory of inductive inference, fnformatzon and Control, 28:125-155, 1975.
	CS83	J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25(2):193-220, 1983.
	DKV92	Robert Daley , Bala Kalyanasundaram , Mahendran Velauthapillai, Breaking the probability ½ barrier in FIN-type learning, Proceedings of the fifth annual workshop on Computational learning theory, p.203-217, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130408]
	DPVW91	Robert Daley , Leonard Pitt , Mahendran Velauthapillai , Todd Will, Relations between probabilistic and team one-shot learners (extended abstract), Proceedings of the fourth annual workshop on Computational learning theory, p.228-239, August 05-07, 1991, Santa Cruz, California, United States
	Fre79	R.V. Freivalds. Finite identification of general recursive functions by probabilistic strategies. In L. Budach, editor, Fundamentals of Computation Theory, pages 138-14:5. Akademie-Verlag, Berlin, 1979.
	FSV89	Rūsiņš Freivalds , C. H. Smith , M. Velauthapillai, Trade-off among parameters affecting inductive inference, Information and Computation, v.82 n.3, p.323-349, Sep. 1989 [doi>10.1016/0890-5401(89)90005-9]
	Gol67	E.M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
	HR58	Jr. H. Rogers. GSdel numberings of partial recursive functions. Journal of Symbolic Logic, 23:331-341, 1958.
	HR67	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	Kin72	E.B. Kinber. Frequency calculations of general recursive predicates and frequency enumeration of sets. Soviet Math Dokl., 13(4):873-876, 1972.
	Kle38	S. Kleene. On notation for ordinal numbers. Journal of Symbolic Logic, 3:150-155, 1938.
	KS91	M. Kummer and F. Stephan. Some aspects of frequency calculation. Technical report, Universit~it Karlsruhe, 1991.
	KW80	R. Klette and R. Wiehagen. Research in the theory of inductive inference by gdr mathematicians - a survey. Information Sciences, 22:149-169, 1980.
	MY78	Michael Machtey , Paul Young, An Introduction to the General Theory of Algorithms, Elsevier Science Inc., New York, NY, 1978
	Pit89	L. Pitt, Probabilistic inductive inference, Journal of the ACM (JACM), v.36 n.2, p.383-433, April 1989 [doi>10.1145/62044.62053]
	PS88	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]
	Smi82	Carl H. Smith, The Power of Pluralism for Automatic Program Synthesis, Journal of the ACM (JACM), v.29 n.4, p.1144-1165, Oct. 1982 [doi>10.1145/322344.322356]
	Tra63	B. Trachtenbrot. On the frequency computability of functions. Algebra i Log~ka, 2:25-32, 1963.
	Vel89	Mahendran Velauthapillai, Inductive inference with bounded number of mind changes, Proceedings of the second annual workshop on Computational learning theory, p.200-213, December 1989, Santa Cruz, California, United States
	WFK84	R. Wiehagen, R. Freivalds, and E. K. Kinbet. On the power of probabilistic strategies in inductive inference. Theoretical Computer Science, 28:111-133, 1984.

CITED BY 2

	John Case , Sanjay Jain , Matthias Ott , Arun Sharma , Frank Stephan, Robust learning aided by context, Proceedings of the eleventh annual conference on Computational learning theory, p.44-55, July 24-26, 1998, Madison, Wisconsin, United States
	Martin Kummer , Frank Stephan, Inclusion problems in parallel learning and games (extended abstract), Proceedings of the seventh annual conference on Computational learning theory, p.287-298, July 12-15, 1994, New Brunswick, New Jersey, United States