Ordered term tree languages which are polynomial time inductively inferable from positive data

DOI10.1016/J.TCS.2005.10.022MaRDI QIDQ817835zbMATHOpenAlexFDO

Authors Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara

Publication date 20 March 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.10.022

zbMATH Keywords

machine learninginductive inferencetree structured pattern

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Knowledge representation (68T30)

Recommendations

• scientific article; zbMATH DE number 1966616
• scientific article; zbMATH DE number 1950784
• scientific article; zbMATH DE number 2089361
• scientific article; zbMATH DE number 1839455
• Efficient learning of ordered and unordered tree patterns with contractible variables

Cites work

• scientific article; zbMATH DE number 2089361 (Why is no real title available?)
• scientific article; zbMATH DE number 1104352 (Why is no real title available?)
• scientific article; zbMATH DE number 1950784 (Why is no real title available?)
• scientific article; zbMATH DE number 1954169 (Why is no real title available?)
• scientific article; zbMATH DE number 2080666 (Why is no real title available?)
• scientific article; zbMATH DE number 1552572 (Why is no real title available?)
• scientific article; zbMATH DE number 2088105 (Why is no real title available?)
• scientific article; zbMATH DE number 3806956 (Why is no real title available?)
• scientific article; zbMATH DE number 1839455 (Why is no real title available?)
• scientific article; zbMATH DE number 1414302 (Why is no real title available?)
• Algorithmic Learning Theory
• Efficient learning of ordered and unordered tree patterns with contractible variables
• Efficient learning of unlabeled term trees with contractible variables from positive data.
• Finding patterns common to a set of strings
• Inductive inference of formal languages from positive data
• Queries and concept learning

Cited in

(9)

• scientific article; zbMATH DE number 2089361 (Why is no real title available?)
• scientific article; zbMATH DE number 1552572 (Why is no real title available?)
• On the Complexity of Extracting Subtree with Keeping Distinguishability
• Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
• Tree size reduction with keeping distinguishability
• scientific article; zbMATH DE number 1966616 (Why is no real title available?)
• Learning Tree Languages
• Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns
• Learning block-preserving graph patterns and its application to data mining

This page was built for publication: Ordered term tree languages which are polynomial time inductively inferable from positive data

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