scientific article; zbMATH DE number 1954169

MaRDI QIDQ4415196zbMATH OpenFDO

Authors Satoshi Matsumoto, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida

Publication date 28 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2557/25570523.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Algorithmic Learning Theory
• Learning of finite unions of tree patterns with repeated internal structured variables from queries
• On exact learning of unordered tree patterns
• scientific article; zbMATH DE number 2089361
• Learning unions of tree patterns using queries

Cited in

(16)

• Learning unions of tree patterns using queries
• On the hardness of learning queries from tree structured data
• Algorithms for learning parsimonious context trees
• Exact Learning of Finite Unions of Graph Patterns from Queries
• scientific article; zbMATH DE number 2080666 (Why is no real title available?)
• Learning Unordered Tree Contraction Patterns in Polynomial Time
• scientific article; zbMATH DE number 1453051 (Why is no real title available?)
• The Complexity of Learning Tree Patterns from Example Graphs
• Algorithmic Learning Theory
• Learning Tree Patterns from Example Graphs
• Efficient learning of unlabeled term trees with contractible variables from positive data.
• Efficient learning of ordered and unordered tree patterns with contractible variables
• Learning of finite unions of tree patterns with repeated internal structured variables from queries
• On exact learning of unordered tree patterns
• Learning unions of tree patterns using queries
• Ordered term tree languages which are polynomial time inductively inferable from positive data

This page was built for publication:

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