MDL learning of unions of simple pattern languages from positive examples
Authors:
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 252-260
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive dataLecture Notes in Computer Science, 1994
- Coding Decision TreesMachine Learning, 1993
- An Introduction to Kolmogorov Complexity and Its Applications1993
- Density estimation by stochastic complexityIEEE Transactions on Information Theory, 1992
- Polynomial-time inference of arbitrary pattern languagesNew Generation Computing, 1991
- Inferring decision trees using the minimum description lenght principleInformation and Computation, 1989
- Finding patterns common to a set of stringsJournal of Computer and System Sciences, 1980
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- Modeling by shortest data descriptionAutomatica, 1978
- Reducibility among Combinatorial Problems1972