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

DOI10.1016/J.TCS.2005.10.022zbMATH Open1086.68114OpenAlexW2130999259MaRDI QIDQ817835FDOQ817835

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

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

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)

Cites Work

• Queries and concept learning
• Inductive inference of formal languages from positive data
• Finding patterns common to a set of strings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic Learning Theory
• Efficient learning of unlabeled term trees with contractible variables from positive data.
• Efficient learning of ordered and unordered tree patterns with contractible variables

Cited In (9)

• Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
• Title not available (Why is that?)
• Tree size reduction with keeping distinguishability
• Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns
• Learning Tree Languages
• On the Complexity of Extracting Subtree with Keeping Distinguishability
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)