Learning unions of tree patterns using queries
From MaRDI portal
Recommendations
- Learning of finite unions of tree patterns with internal structured variables from queries
- On exact learning of unordered tree patterns
- On learning unions of pattern languages and tree patterns
- Exact Learning of Finite Unions of Graph Patterns from Queries
- Finding tree patterns consistent with positive and negative examples using queries
Cites work
- A polynomial time algorithm for finding finite unions of tree pattern languages
- Computational limitations on learning from examples
- Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data
- Finding patterns common to a set of strings
- Finding tree patterns consistent with positive and negative examples using queries
- scientific article; zbMATH DE number 3349328 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- Inclusion is undecidable for pattern languages
- Lange and Wiehagen's pattern language learning algorithm: an average-case analysis with respect to its total learning time
- Learning conjunctions of Horn clauses
- Lower bound methods and separation results for on-line learning models
- Prediction-preserving reducibility
- Queries and concept learning
- The learnability of description logics with equality constraints
Cited in
(18)- Finding tree patterns consistent with positive and negative examples using queries
- Learning from examples and membership queries with structured determinations
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- Learning elementary formal systems with queries.
- On the hardness of learning queries from tree structured data
- The subsumption lattice and query learning
- Exact Learning of Finite Unions of Graph Patterns from Queries
- Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses
- Learning of finite unions of tree patterns with internal structured variables from queries
- Finding tree patterns consistent with positive and negative examples using queries
- Efficient learning of semi-structured data from queries
- Learning Unordered Tree Contraction Patterns in Polynomial Time
- On learning unions of pattern languages and tree patterns
- The Complexity of Learning Tree Patterns from Example Graphs
- The subsumption lattice and query learning
- Learning Tree Patterns from Example Graphs
- On exact learning of unordered tree patterns
- Learning unions of tree patterns using queries
This page was built for publication: Learning unions of tree patterns using queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1390942)