Communications of the ACM
A guided tour of Chernoff bounds
Information Processing Letters
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
Identification of unions of languages drawn from an identifiable class
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
Learning elementary formal systems
Theoretical Computer Science
Applications of inductive logic programming
Communications of the ACM
Learning one-variable pattern languages in linear average time
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Learning subsequence languages
Information modelling and knowledge bases VIII
Incremental concept learning for bounded data mining
Information and Computation
Inductive inference of unbounded unions of pattern languages from positive data
Theoretical Computer Science - Special issue on algorithmic learning theory
An average-case optimal one-variable pattern language learner
Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Polynomial-time learning of elementary formal systems
New Generation Computing
Theoretical Computer Science
Predictive learning models for concept drift
Theoretical Computer Science - Algorithmic learning theory
Machine Learning
On Exact Learning of Unordered Tree Patterns
Machine Learning
Inductive Logic Programming: Techniques and Applications
Inductive Logic Programming: Techniques and Applications
Finding tree patterns consistent with positive and negative examples using queries
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
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
Polynomial Time Inference of Extended Regular Pattern Languages
Proceedings of RIMS Symposium on Software Science and Engineering
Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract)
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
MDL learning of unions of simple pattern languages from positive examples
EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
A Negative Result on Inductive Inference of Extended Pattern Languages
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Automatic learning of subclasses of pattern languages
Information and Computation
| Hi-index | 0.00 |
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1... αmxm, where x0,..., xm are variables and α1,..., αm strings of terminals of length c each, it runs with arbitrarily high probability of success using a number of examples polynomial in m (and exponential in c). It is assumed that m is unknown, but c is known and that samples are randomly drawn according to some distribution, for which we only require that it has certain natural and plausible properties.Aiming to improve this algorithm further we also explore computer simulations of a heuristic.