Efficient learning of unlabeled term trees with contractible variables from positive data.

DOI10.1007/B13700MaRDI QIDQ5897188zbMATH OpenOpenAlexDBLPFDO

Authors Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida

Publication date 23 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13700

Mathematics Subject Classification ID

Data structures (68P05) Computational learning theory (68Q32) Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Efficient learning of ordered and unordered tree patterns with contractible variables
• Polynomial time inductive inference of ordered tree patterns with internal structured variables from positive data
• Ordered term tree languages which are polynomial time inductively inferable from positive data
• On exact learning of unordered tree patterns
• Learning of finite unions of tree patterns with internal structured variables from queries

Cited in

(4)

• Ordered term tree languages which are polynomial time inductively inferable from positive data
• Extraction of tag tree patterns with contractible variables from irregular semistructured data
• Efficient learning of ordered and unordered tree patterns with contractible variables
• Ordered term tree languages which are polynomial time inductively inferable from positive data

This page was built for publication: Efficient learning of unlabeled term trees with contractible variables from positive data.

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