Exact Learning of Finite Unions of Graph Patterns from Queries
From MaRDI portal
Recommendations
Cites work
- A polynomial time algorithm for finding finite unions of tree pattern languages
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns
- Discovery of frequent tag tree patterns in semistructured web documents
- Efficient learning of semi-structured data from queries
- Foundations of logic programming.
- Inductive Logic Programming
- Learning of finite unions of tree patterns with internal structured variables from queries
- Learning of finite unions of tree patterns with repeated internal structured variables from queries
- On exact learning of unordered tree patterns
- Polynomial time inductive inference of ordered tree patterns with internal structured variables from positive data
- Polynomial time inductive inference of regular term tree languages from positive data
- Topology of series-parallel networks
Cited in
(6)- Learning unions of tree patterns using queries
- Learning block-preserving graph patterns and its application to data mining
- On the regularity and learnability of ordered DAG languages
- Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
- scientific article; zbMATH DE number 2068174 (Why is no real title available?)
- Inductive Logic Programming
This page was built for publication: Exact Learning of Finite Unions of Graph Patterns from Queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520068)