Efficient learning of semi-structured data from queries

DOI10.1007/3-540-45583-3_24MaRDI QIDQ4473562zbMATH OpenFDO

Authors Hiroki Arimura, Hiroshi Sakamoto, S. Arikawa

Publication date 4 August 2004

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

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

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Learning of finite unions of tree patterns with internal structured variables from queries
• Algorithmic Learning Theory
• On the hardness of learning queries from tree structured data
• Learning unions of tree patterns using queries
• On exact learning of unordered tree patterns

Cited in

(6)

• Learning block-preserving graph patterns and its application to data mining
• LAQP: learning-based approximate query processing
• Exact Learning of Finite Unions of Graph Patterns from Queries
• Speeding Up Inference in Statistical Relational Learning by Clustering Similar Query Literals
• On the Power of Learning from k-Wise Queries
• Ordered term tree languages which are polynomial time inductively inferable from positive data

This page was built for publication: Efficient learning of semi-structured data from queries

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