On exact learning of unordered tree patterns

DOI10.1023/A:1010971904477MaRDI QIDQ5946372zbMATH OpenOpenAlexFDO

Authors Thomas R. Amoth, Paul Cull, Prasad Tadepalli

Publication date 14 October 2001

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1010971904477

zbMATH Keywords

symbolic mathematics

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1954169
• Learning unions of tree patterns using queries
• Learning Tree Patterns from Example Graphs
• Efficient learning of ordered and unordered tree patterns with contractible variables
• Algorithmic Learning Theory

Cited in

(16)

• Learning unions of tree patterns using queries
• Trees and learning
• Precedence-inclusion patterns and relational learning
• scientific article; zbMATH DE number 1670727 (Why is no real title available?)
• Exact Learning of Finite Unions of Graph Patterns from Queries
• scientific article; zbMATH DE number 1954169 (Why is no real title available?)
• scientific article; zbMATH DE number 2077169 (Why is no real title available?)
• scientific article; zbMATH DE number 2080666 (Why is no real title available?)
• scientific article; zbMATH DE number 1881087 (Why is no real title available?)
• Learning Unordered Tree Contraction Patterns in Polynomial Time
• The Complexity of Learning Tree Patterns from Example Graphs
• Algorithmic Learning Theory
• Learning Tree Patterns from Example Graphs
• Efficient learning of unlabeled term trees with contractible variables from positive data.
• Learning unions of tree patterns using queries
• Learning a subclass of regular patterns in polynomial time

This page was built for publication: On exact learning of unordered tree patterns

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