Learning relational patterns

DOI10.1007/978-3-642-24412-4_10MaRDI QIDQ3093941zbMATH OpenOpenAlexFDO

Authors Michael Geilke, Sandra Zilles

Publication date 19 October 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24412-4_10

Mathematics Subject Classification ID

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

Recommendations

• Identification of pattern languages from examples and queries
• scientific article; zbMATH DE number 2149593
• Learning a subclass of regular patterns in polynomial time
• scientific article; zbMATH DE number 1372649
• Polynomial-time inference of arbitrary pattern languages

Cited in

(14)

• Learning pattern languages over groups
• Pattern matching with variables: a multivariate complexity analysis
• Distinguishing pattern languages with membership examples
• Precedence-inclusion patterns and relational learning
• scientific article; zbMATH DE number 1690092 (Why is no real title available?)
• On the parameterised complexity of string morphism problems
• scientific article; zbMATH DE number 1301671 (Why is no real title available?)
• scientific article; zbMATH DE number 2084853 (Why is no real title available?)
• Patterns with bounded treewidth
• The equivalence problem of E-pattern languages with regular constraints is undecidable
• Case-based representation and learning of pattern languages
• Distinguishing relational pattern languages with a small number of short strings
• The equivalence problem of E-pattern languages with length constraints is undecidable
• The equivalence problem of E-pattern languages with regular constraints is undecidable

This page was built for publication: Learning relational patterns

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