Find link

language:

Find link is a tool written by Edward Betts.

searching for Computational learning theory 29 found (288 total)

alternate case: computational learning theory

Preference elicitation (209 words) [view diff] exact match in snippet view article find links to article

and avoid redundancy. This problem is sometimes studied as a computational learning theory problem. Another approach for formulating this problem is a

David Haussler (1,958 words) [view diff] exact match in snippet view article find links to article

National Academy of Engineering in 2018 for developments in computational learning theory and bioinformatics, including first assembly of the human genome

Geoffrey J. Gordon (363 words) [view diff] exact match in snippet view article find links to article

statistical models of difficult data (e.g. maps, video, text), computational learning theory, and game theory. Gordon received a B.A. in computer science

Regularization perspectives on support vector machines (1,475 words) [view diff] case mismatch in snippet view article find links to article

). Computational Learning Theory, 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning

Speed prior (145 words) [view diff] case mismatch in snippet view article find links to article

Sloan, editors, Proceedings of the 15th Annual Conference on Computational Learning Theory (COLT 2002). Lecture Notes in Artificial Intelligence, pages

Co-training (831 words) [view diff] case mismatch in snippet view article find links to article

data with co-training. COLT: Proceedings of the Workshop on Computational Learning Theory, Morgan Kaufmann, 1998, p. 92-100. Committee on the Fundamentals

Finite thickness (293 words) [view diff] case mismatch in snippet view article find links to article

"Ordinal mind change complexity of language identification". Computational Learning Theory (PDF). LNCS. Vol. 1208. Springer. pp. 301–315.; here: Definition

Sequential minimal optimization (1,009 words) [view diff] exact match in snippet view article find links to article

margin classifiers". Proceedings of the fifth annual workshop on Computational learning theory - COLT '92. p. 144. CiteSeerX 10.1.1.21.3818. doi:10.1145/130385

Coupled pattern learner (1,138 words) [view diff] exact match in snippet view article find links to article

co-training". Proceedings of the eleventh annual conference on Computational learning theory. pp. 92–100. doi:10.1145/279943.279962. ISBN 1581130570. S2CID 207228399

Graph kernel (624 words) [view diff] case mismatch in snippet view article find links to article

efficient alternatives. Proc. the 16th Annual Conference on Computational Learning Theory (COLT) and the 7th Kernel Workshop. doi:10.1007/978-3-540-45167-9_11

Umesh Vazirani (547 words) [view diff] case mismatch in snippet view article find links to article

Michael J.; Vazirani, Umesh V. (1994), An Introduction to Computational Learning Theory, MIT Press, ISBN 9780262111935. Bennett, Charles H.; Bernstein

Apprenticeship learning (1,336 words) [view diff] exact match in snippet view article find links to article

environments". Proceedings of the eleventh annual conference on Computational learning theory. pp. 101–103. doi:10.1145/279943.279964. S2CID 546942. Havens

Farthest-first traversal (3,123 words) [view diff] case mismatch in snippet view article find links to article

Jyrki; Sloan, Robert H. (eds.), Computational Learning Theory, 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July

Variation of information (1,390 words) [view diff] case mismatch in snippet view article find links to article

Learning Theory and Kernel Machines. 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop. Lecture Notes in Computer Science,

David A. McAllester (869 words) [view diff] exact match in snippet view article find links to article

theorems". Proceedings of the eleventh annual conference on Computational learning theory - COLT' 98. Association for Computing Machinery. pp. 230–234

Ear decomposition (1,904 words) [view diff] exact match in snippet view article find links to article

"Independence and port oracles for matroids, with an application to computational learning theory", Combinatorica, 16 (2): 189–208, doi:10.1007/BF01844845, MR 1401892

Good–Turing frequency estimation (1,846 words) [view diff] case mismatch in snippet view article find links to article

Estimators, Proceedings of the Thirteenth Annual Conference on Computational Learning Theory pp. 1–6 David A. McAllester, Ortiz, Luis (2003) Concentration

Inquiry (4,962 words) [view diff] case mismatch in snippet view article find links to article

and Leonard Pitt (eds.), Proceedings of the 1988 Workshop on Computational Learning Theory, MIT, 3–5 August 1988, Morgan Kaufmann, San Mateo, CA, 1989

International Federation for Information Processing (4,167 words) [view diff] case mismatch in snippet view article find links to article

Complexity WG 1.3 Foundations of System Specification WG 1.4 Computational Learning Theory WG 1.5 Cellular Automata and Discrete Complex Systems WG 1.6

Deterministic finite automaton (3,736 words) [view diff] exact match in snippet view article find links to article

uniform examples". Proceedings of the fifth annual workshop on Computational learning theory - COLT '92. pp. 45–52. doi:10.1145/130385.130390. ISBN 089791497X

Multiverse (7,461 words) [view diff] case mismatch in snippet view article find links to article

Near-Optimal Computable Predictions. Proc. 15th Annual Conference on Computational Learning Theory (COLT 2002), Sydney, Australia, Lecture Notes in Artificial

Bayesian interpretation of kernel regularization (2,778 words) [view diff] case mismatch in snippet view article find links to article

Smola, Alex J. (2001). "A Generalized Representer Theorem". Computational Learning Theory. Lecture Notes in Computer Science. Vol. 2111/2001. pp. 416–426

Occam's razor (10,888 words) [view diff] case mismatch in snippet view article find links to article

the Bayesian "Occam Factors" Argument for Occam's Razor, in "Computational Learning Theory and Natural Learning Systems: Selecting Good Models", MIT Press

Anthropic principle (9,531 words) [view diff] exact match in snippet view article find links to article

computable predictions." Proceedings of 15th annual conference on computational learning theory (COLT 2002), Sydney, Australia, Lecture notes in artificial

Kernel Fisher discriminant analysis (3,659 words) [view diff] case mismatch in snippet view article find links to article

R.; Smola, A. (2001). "A Generalized Representer Theorem". Computational Learning Theory. Lecture Notes in Computer Science. Vol. 2111. pp. 416–426.

Matroid oracle (4,287 words) [view diff] exact match in snippet view article find links to article

"Independence and port oracles for matroids, with an application to computational learning theory", Combinatorica, 16 (2): 189–208, doi:10.1007/BF01844845, MR 1401892

Maximal independent set (5,451 words) [view diff] case mismatch in snippet view article find links to article

independent sets of bounded-degree hypergraphs", Proc. Tenth Conf. Computational Learning Theory, pp. 211–217, doi:10.1145/267460.267500, ISBN 978-0-89791-891-6

Outline of natural language processing (7,757 words) [view diff] exact match in snippet view article find links to article

subfield of computer science that examines pattern recognition and computational learning theory in artificial intelligence. There are three broad approaches

Characteristic samples (2,764 words) [view diff] exact match in snippet view article find links to article

polynomial time". Proceedings of the seventh annual conference on Computational learning theory - COLT '94. New York, New York, USA: ACM Press. pp. 140–146