A Polynomial Time Learner for a Subclass of Regular Patterns

Presented is an algorithm (for learning a subclass of erasing regular pattern languages) which can be made to run with arbitrarily high probability of success on extended regular languages generated by patterns of the form x0 1x1::: mxm for unknown m but known c , from number of examples polynomial in m (and exponential in c ), where x0; : : : ; xm are variables and where 1; :::; m are each strings of terminals of length c . This assumes that the algorithm randomly draws samples with natural and plausible assumptions on the distribution. With the aim of nding a better algorithm, we also explore computer simulations of a heuristic.

[1]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[2]  Thomas Erlebach,et al.  Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries , 1997, Theor. Comput. Sci..

[3]  Ivan Bratko,et al.  Applications of inductive logic programming , 1995, CACM.

[4]  Takeshi Shinohara,et al.  Polynomial Time Inference of Extended Regular Pattern Languages , 1983, RIMS Symposium on Software Science and Engineering.

[5]  Luc De Raedt,et al.  Inductive Logic Programming: Theory and Methods , 1994, J. Log. Program..

[6]  John Case,et al.  Predictive Learning Models for Concept Drift , 1998, ALT.

[7]  Thomas Zeugmann,et al.  Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time , 1995, Annals of Mathematics and Artificial Intelligence.

[8]  Esko Ukkonen,et al.  Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract) , 1996, ISAAC.

[9]  Setsuo Arikawa,et al.  Pattern Inference , 1995, GOSLER Final Report.

[10]  Saso Dzeroski,et al.  Inductive Logic Programming: Techniques and Applications , 1993 .

[11]  T. Shinohara.  INFERRING UNIONS OF TWO PATTERN LANGUAGES , 1983 .

[12]  Robert Peter Nix.  Editing by example (text) , 1983 .

[13]  John Case,et al.  Incremental Concept Learning for Bounded Data Mining , 1997, Inf. Comput..

[14]  Keith Wright.  Identification of unions of languages drawn from an identifiable class , 1989, COLT '89.

[15]  Satoshi Matsumoto,et al.  Learnability of Subsequence Languages , 1996 .

[16]  Rüdiger Reischuk,et al.  An Average-Case Optimal One-Variable Pattern Language Learner , 2000, J. Comput. Syst. Sci..

[17]  Heikki Mannila,et al.  MDL learning of unions of simple pattern languages from positive examples , 1995, EuroCOLT.

[18]  Robert E. Schapire,et al.  Pattern languages are not learnable , 1990, Annual Conference Computational Learning Theory.

[19]  Rüdiger Reischuk,et al.  Learning one-variable pattern languages in linear average time , 1997, COLT' 98.

[20]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, CACM.

[21]  R. Smullyan.  Theory of formal systems , 1962 .

[22]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[23]  Akihiro Yamamoto,et al.  Learning Elementary Formal Systems , 1992, Theor. Comput. Sci..

[24]  Robert Nix,et al.  Editing by example , 1985, POPL '84.

[25]  Arto Salomaa,et al.  Return to Patterns , 1995, Bull. EATCS.

[26]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[27]  Arto Salomaa,et al.  The Formal Language Theory Column , 1987, Bull. EATCS.

[28]  Daniel Reidenbach,et al.  A Discontinuity in Pattern Inference , 2004, STACS.

[29]  Torben Hagerup,et al.  A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..

[30]  Daniel Reidenbach.  A Negative Result on Inductive Inference of Extended Pattern Languages , 2002, ALT.

[31]  Hiroki Arimura,et al.  Inductive inference of unbounded unions of pattern languages from positive data , 2000, Theor. Comput. Sci..

[32]  Thomas Zeugmann,et al.  Stochastic Finite Learning of the Pattern Languages , 2001, Machine Learning.

[33]  Thomas Erlebach,et al.  Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries , 2001, Theor. Comput. Sci..

[34]  Leonard Pitt,et al.  A polynomial-time algorithm for learning k-variable pattern languages from examples , 1989, COLT '89.

[35]  Ayumi Shinohara,et al.  Knowledge Acquisition from Amino Acid Sequences by Machine Learning System BONSAI , 1992 .