scientific article; zbMATH DE number 2089361

zbMATH Open1050.68077MaRDI QIDQ3046705FDOQ3046705

Authors: Yusuke Suzuki, Ryuta Akanuma, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida 

Publication date: 12 August 2004

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

scientific article; zbMATH DE number Title of this publication is (Why is no real title available?)

Recommendations

• scientific article; zbMATH DE number 1966616
• scientific article; zbMATH DE number 1950784
• Ordered term tree languages which are polynomial time inductively inferable from positive data
• scientific article; zbMATH DE number 1839455
• Efficient learning of ordered and unordered tree patterns with contractible variables

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cited In (14)

• Learning of finite unions of tree patterns with repeated internal structured variables from queries
• Efficient learning of unlabeled term trees with contractible variables from positive data.
• Efficient learning of ordered and unordered tree patterns with contractible variables
• Exact Learning of Finite Unions of Graph Patterns from Queries
• Title not available (Why is no real title available?)
• Polynomial time pattern matching algorithm for ordered graph patterns
• Inductive Logic Programming
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Algorithmic Learning Theory
• 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 Q3046705)