Learning unions of tree patterns using queries

DOI10.1016/S0304-3975(97)00015-7MaRDI QIDQ1390942zbMATH OpenDBLPWikidataFDO

Authors Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara

Publication date 22 July 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

learninglogic programs

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1954169
• On exact learning of unordered tree patterns
• scientific article; zbMATH DE number 1453051
• Exact Learning of Finite Unions of Graph Patterns from Queries
• Finding tree patterns consistent with positive and negative examples using queries

Cites work

• scientific article; zbMATH DE number 408772 (Why is no real title available?)
• scientific article; zbMATH DE number 2077169 (Why is no real title available?)
• scientific article; zbMATH DE number 1414302 (Why is no real title available?)
• scientific article; zbMATH DE number 3349328 (Why is no real title available?)
• scientific article; zbMATH DE number 3349329 (Why is no real title available?)
• Computational limitations on learning from examples
• Finding patterns common to a set of strings
• 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

(17)

• scientific article; zbMATH DE number 2077169 (Why is no real title available?)
• Learning Unordered Tree Contraction Patterns in Polynomial Time
• Algorithmic Learning Theory
• The subsumption lattice and query learning
• Learning Tree Patterns from Example Graphs
• Exact Learning of Finite Unions of Graph Patterns from Queries
• On the hardness of learning queries from tree structured data
• Learning unions of tree patterns using queries
• Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses
• On exact learning of unordered tree patterns
• Finding tree patterns consistent with positive and negative examples using queries
• On learning unions of pattern languages and tree patterns in the mistake bound model.
• scientific article; zbMATH DE number 1954169 (Why is no real title available?)
• scientific article; zbMATH DE number 2080666 (Why is no real title available?)
• Learning elementary formal systems with queries.
• The Complexity of Learning Tree Patterns from Example Graphs
• scientific article; zbMATH DE number 1453051 (Why is no real title available?)

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)