Finding tree patterns consistent with positive and negative examples using queries

DOI10.1023/A:1018912223866MaRDI QIDQ1273755zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara

Publication date 6 January 1999

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

membership queriesconsistency problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 2077169
• Learning unions of tree patterns using queries
• Learning unions of tree patterns using queries
• Finding patterns and periods in Cartesian tree matching
• Patterns and pattern-matching in trees: An analysis
• Learning Tree Patterns from Example Graphs
• Conjunctive queries over trees
• Tree pattern query minimization

Cited in

(5)

• scientific article; zbMATH DE number 2077169 (Why is no real title available?)
• Three \(\sum^ P_ 2\)-complete problems in computational learning theory
• Learning a subclass of regular patterns in polynomial time
• Learning unions of tree patterns using queries
• Learning Tree Languages

This page was built for publication: Finding tree patterns consistent with positive and negative examples using queries

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