The Complexity of Learning Tree Patterns from Example Graphs

DOI10.1145/2890492MaRDI QIDQ5012559zbMATH OpenOpenAlexFDO

Authors Yaacov Y. Weiss, Sara Cohen

Publication date 25 November 2021

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2890492

zbMATH Keywords

graphslearningtree patterns

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Learning Tree Patterns from Example Graphs
• On exact learning of unordered tree patterns
• Learning Unordered Tree Contraction Patterns in Polynomial Time
• Exact learning of multitrees and almost-trees using path queries
• Learning unions of tree patterns using queries
• Learning unions of tree patterns using queries
• A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness
• scientific article; zbMATH DE number 1954169
• Efficient learning of ordered and unordered tree patterns with contractible variables
• Characterizing tractability of simple well-designed pattern trees with projection

Cited in

(7)

• Learning Node Label Controlled Graph Grammars (Extended Abstract)
• scientific article; zbMATH DE number 2077169 (Why is no real title available?)
• Minimization of tree patterns
• Learning Unordered Tree Contraction Patterns in Polynomial Time
• scientific article; zbMATH DE number 7561480 (Why is no real title available?)
• Learning Tree Patterns from Example Graphs
• Learning tree pattern transformations

This page was built for publication: The Complexity of Learning Tree Patterns from Example Graphs

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