Learning a subclass of regular patterns in polynomial time

DOI10.1016/J.TCS.2006.07.044MaRDI QIDQ860829zbMATH OpenOpenAlexWikidataFDO

Authors John Case, Sanjay Jain, Frank Stephan, Thomas Zeugmann, Rüdiger Reischuk

Publication date 9 January 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.07.044

zbMATH Keywords

average-case analysispattern languagesalgorithmic learningprobabilistically exact learning

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Recommendations

• Learning a subclass of regular patterns in polynomial time
• scientific article; zbMATH DE number 2143051
• scientific article; zbMATH DE number 1910401
• Learning erasing pattern languages with queries
• scientific article; zbMATH DE number 980420

Cites work

• scientific article; zbMATH DE number 3817068 (Why is no real title available?)
• scientific article; zbMATH DE number 67610 (Why is no real title available?)
• scientific article; zbMATH DE number 67629 (Why is no real title available?)
• scientific article; zbMATH DE number 709539 (Why is no real title available?)
• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• scientific article; zbMATH DE number 1966625 (Why is no real title available?)
• scientific article; zbMATH DE number 3806956 (Why is no real title available?)
• scientific article; zbMATH DE number 743586 (Why is no real title available?)
• scientific article; zbMATH DE number 784360 (Why is no real title available?)
• A guided tour of Chernoff bounds
• A theory of the learnable
• An average-case optimal one-variable pattern language learner
• Discovering unbounded unions of regular pattern languages from positive examples
• Finding patterns common to a set of strings
• Finding tree patterns consistent with positive and negative examples using queries
• Incremental concept learning for bounded data mining.
• Inductive Logic Programming: Theory and methods
• Inductive inference of unbounded unions of pattern languages from positive data
• Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
• Language identification in the limit
• Learning Theory
• Learning elementary formal systems
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
• On exact learning of unordered tree patterns
• On learning unions of pattern languages and tree patterns in the mistake bound model.
• Polynomial-time inference of arbitrary pattern languages
• Predictive learning models for concept drift
• STACS 2004
• Stochastic finite learning of the pattern languages
• Theory of Formal Systems. (AM-47)

Cited in

(4)

• Automatic learning of subclasses of pattern languages
• Decision lists over regular patterns.
• scientific article; zbMATH DE number 980420 (Why is no real title available?)
• Learning a subclass of regular patterns in polynomial time

This page was built for publication: Learning a subclass of regular patterns in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860829)