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

DOI10.1016/j.tcs.2005.10.022zbMath1086.68114OpenAlexW2130999259MaRDI QIDQ817835

Tetsuhiro Miyahara, Takayoshi Shoudai, Yusuke Suzuki, Tomoyuki Uchida

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

inductive inferencemachine learningtree structured pattern

Mathematics Subject Classification ID

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

Related Items (6)

Tree size reduction with keeping distinguishability ⋮ On the Complexity of Extracting Subtree with Keeping Distinguishability ⋮ Learning Tree Languages ⋮ Learning block-preserving graph patterns and its application to data mining ⋮ Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining ⋮ Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding patterns common to a set of strings
• Queries and concept learning
• Inductive inference of formal languages from positive data
• Algorithmic Learning Theory
• Inductive Logic Programming
• Algorithmic Learning Theory

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