Efficient learning of ordered and unordered tree patterns with contractible variables
From MaRDI portal
Recommendations
Cited in
(14)- scientific article; zbMATH DE number 2089361 (Why is no real title available?)
- scientific article; zbMATH DE number 1966616 (Why is no real title available?)
- scientific article; zbMATH DE number 1977846 (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
- Detecting irrelevant subtrees to improve probabilistic learning from tree-structured data
- Combinatorial Pattern Matching
- Learning Tree Patterns from Example Graphs
- Efficient learning of unlabeled term trees with contractible variables from positive data.
- Learning of finite unions of tree patterns with repeated internal structured variables from queries
- On exact learning of unordered tree patterns
- Ordered term tree languages which are polynomial time inductively inferable from positive data
This page was built for publication: Efficient learning of ordered and unordered tree patterns with contractible variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897382)