Identification of unions of languages drawn from an identifiable class
COLT '89 Proceedings of the second annual workshop on Computational learning theory
The correct definition of finite elasticity: corrigendum to identification of unions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Decision problems for patterns
Journal of Computer and System Sciences
Inductive inference of unbounded unions of pattern languages from positive data
Theoretical Computer Science - Special issue on algorithmic learning theory
Polynomial Time Inference of Extended Regular Pattern Languages
Proceedings of RIMS Symposium on Software Science and Engineering
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Characteristic Sets for Unions of Regular Pattern Languages and Compactness
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
A Practical Algorithm to Find the Best Subsequence Patterns
DS '00 Proceedings of the Third International Conference on Discovery Science
Best fitting fixed-length substring patterns for a set of strings
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Measuring over-generalization in the minimal multiple generalizations of biosequences
DS'05 Proceedings of the 8th international conference on Discovery Science
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
Measuring over-generalization in the minimal multiple generalizations of biosequences
DS'05 Proceedings of the 8th international conference on Discovery Science
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
| Hi-index | 0.00 |
We are interested in learning unions of the pattern languages in the limit from positive data using strategies that guarantee some form of minimality during the learning process. It is known that for any class of languages with so-called finite elasticity, any learning strategy that finds a language that is minimal with respect to inclusion (MINL) ensures identification in the limit. We consider a learning strategy via another form of minimality — the minimality in the number of elements that are shorter than a specified length. A search for languages with this minimality is possible in many cases, and the search can be adapted to identify any class where every language in the class has a characteristic set within the class. We compare solutions using this strategy to those from MINL to illustrate how we may obtain solutions that fulfill both notions of minimality. Finally, we show how the results are relevant using some subclasses of the pattern languages.