Learning Unordered Tree Contraction Patterns in Polynomial Time

DOI10.1007/978-3-642-38812-5_18MaRDI QIDQ4928423zbMATH OpenOpenAlexFDO

Authors Yuta Yoshimura, Takayoshi Shoudai

Publication date 14 June 2013

Published in Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38812-5_18

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Efficient learning of ordered and unordered tree patterns with contractible variables
• On exact learning of unordered tree patterns
• scientific article; zbMATH DE number 1839455
• Learning unions of tree patterns using queries
• Learning unions of tree patterns using queries
• The Complexity of Learning Tree Patterns from Example Graphs
• scientific article; zbMATH DE number 1453051
• scientific article; zbMATH DE number 1954169
• Learning of finite unions of tree patterns with repeated internal structured variables from queries
• scientific article; zbMATH DE number 996383

Cited in

(4)

• scientific article; zbMATH DE number 1839455 (Why is no real title available?)
• Polynomial time pattern matching algorithm for ordered graph patterns
• The Complexity of Learning Tree Patterns from Example Graphs
• Efficient learning of ordered and unordered tree patterns with contractible variables

This page was built for publication: Learning Unordered Tree Contraction Patterns in Polynomial Time

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