Learning a subclass of regular patterns in polynomial time

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.

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

[2]  松本 哲志,et al.  Learnability of Subsequence Languages , 1996 .

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

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

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

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

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

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

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

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

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

[12]  Daniel Reidenbach.  On the Learnability of E-pattern Languages over Small Alphabets , 2004, COLT.

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

[14]  Raymond M. Smullyan,et al.  Theory of Formal Systems. (AM-47) , 1961 .

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

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

[17]  Stephen Kwek,et al.  On learning unions of pattern languages and tree patterns in the mistake bound model , 2002, Theor. Comput. Sci..

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

[19]  Paul Cull,et al.  On Exact Learning of Unordered Tree Patterns , 2001, Machine Learning.

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

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

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

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

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

[25]  Hiroki Arimura,et al.  Finding tree patterns consistent with positive and negative examples using queries , 2004, Annals of Mathematics and Artificial Intelligence.

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

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

[28]  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.

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

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

[31]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[32]  Steffen Lange,et al.  Algorithmic Learning for Knowledge-Based Systems , 1995, Lecture Notes in Computer Science.

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

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

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

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

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

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

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