Pattern languages are not learnable
COLT '90 Proceedings of the third annual workshop on Computational learning theory
A polynomial-time algorithm for learning k-variable pattern languages from examples
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Polynomial-time inference of arbitrary pattern languages
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Bayesian inductive logic programming
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Text algorithms
Incremental learning from positive data
Journal of Computer and System Sciences
Annals of Mathematics and Artificial Intelligence
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Inductive Inference, DFAs, and Computational Complexity
AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Stochastic Finite Learning of the Pattern Languages
Machine Learning
On learning unions of pattern languages and tree patterns in the mistake bound model
Theoretical Computer Science
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Finding a One-Variable Pattern from Incomplete Data
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
On Learning Unions of Pattern Languages and Tree Patterns
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
The VC-Dimension of Subclasses of Pattern
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Average-Case Analysis of Classification Algorithms for Boolean Functions and Decision Trees
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
A non-learnable class of E-pattern languages
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
From learning in the limit to stochastic finite learning
Theoretical Computer Science - Algorithmic learning theory
Learning a subclass of regular patterns in polynomial time
Theoretical Computer Science - Algorithmic learning theory
A complete and tight average-case analysis of learning monomials
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |