Learning of finite unions of tree patterns with repeated internal structured variables from queries

DOI10.1007/B14273zbMATH Open1263.68138OpenAlexW4301133113MaRDI QIDQ5897384FDOQ5897384

Authors: Satoshi Matsumoto, Yusuke Suzuki, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida 

Publication date: 23 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b14273

Recommendations

• scientific article; zbMATH DE number 1954169
• Algorithmic Learning Theory
• Efficient learning of ordered and unordered tree patterns with contractible variables
• scientific article; zbMATH DE number 1839455
• scientific article; zbMATH DE number 2089361

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25) Computational learning theory (68Q32) Internet topics (68M11)

Cited In (6)

• Learning Unordered Tree Contraction Patterns in Polynomial Time
• 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
• Title not available (Why is that?)
• Algorithmic Learning Theory

This page was built for publication: Learning of finite unions of tree patterns with repeated internal structured variables from queries

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