Exact learning of unordered tree patterns from queries
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Polynomial Time Inference of Extended Regular Pattern Languages
Proceedings of RIMS Symposium on Software Science and Engineering
Polynomial Time Matching Algorithms for Tree-Like Structured Patterns in Knowledge Discovery
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
Discovery of Frequent Tree Structured Patterns in Semistructured Web Documents
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
Discovery of Frequent Tag Tree Patterns in Semistructured Web Documents
PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Efficient Learning of Semi-structured Data from Queries
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Ordered term tree languages which are polynomial time inductively inferable from positive data
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Exact Learning of Finite Unions of Graph Patterns from Queries
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
IEICE - Transactions on Information and Systems
Extraction of tag tree patterns with contractible variables from irregular semistructured data
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
A genetic programming approach to extraction of glycan motifs using tree structured patterns
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
A polynomial time matching algorithm of ordered tree patterns having height-constrained variables
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Polynomial time inductive inference of TTSP graph languages from positive data
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Evolution of characteristic tree structured patterns from semistructured documents
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
| Hi-index | 0.00 |
Tree structured data such as HTML/XML files are represented by rooted trees with ordered children and edge labels. As a representation of a tree structured pattern in such tree structured data, we propose an ordered tree pattern, called a term tree, which is a rooted tree pattern consisting of ordered children and internal structured variables. A term tree is a generalization of standard tree patterns representing first order terms in formal logic. For a set of edge labels 驴 and a term tree t, the term tree language of t, denoted by L驴(t), is the set of all labeled trees which are obtained from a term tree t by substituting arbitrary labeled trees for all variables in t. In this paper, we propose polynomial time algorithms for the following two problems for two fundamental classes of term trees. The membership problem is, given a term tree t and a tree T, to decide whether or not L驴(t) includes T. The minimal language problem is, given a set of labeled trees S, to find a term tree t such that L驴(t) is minimal among all term tree languages which contain all trees in S. Then, by using these two algorithms, we show that the two classes of term trees are polynomial time inductively inferable from positive data.