Exact learning of tree patterns from queries and counterexamples
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Exact learning of unordered tree patterns from queries
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Learning subsequence languages
Information modelling and knowledge bases VIII
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Machine Learning
Machine Learning
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
Learning Pattern Languages Using Queries
EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory
Learning Unions of Tree Patterns Using Queries
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
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
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
A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages
Proceedings of the Second International Workshop on Nonmonotonic and Inductive Logic
COLT '02 Proceedings of the 15th Annual Conference on Computational 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
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
Learning of elementary formal systems with two clauses using queries
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Polynomial time inductive inference of TTSP graph languages from positive data
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
| Hi-index | 0.00 |
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered tree pattern with internal structured variables, called a term tree, is a rooted tree pattern which consists of tree structures with ordered children and internal structured variables. A term tree is suited for representing structural features in semistructured or tree structured data such as HTML/XML files. The language L(t) of a term tree t is the set of all trees which are obtained from t by substituting arbitrary trees for all variables in t. Moreover, for a finite set H of term trees, L(H) = 驴t驴H L(t). Let H*, which is a target of learning, be a finite set of term trees. An oracle for restricted subset queries answers "yes" for an input set H if L(H) 驴 L(H*), and answers "no", otherwise. An oracle for equivalence queries returns "yes" for an input set H if L(H) = L(H*), and returns a counterexample in L(H)驴L(H*)-L(H)驴L(H*), otherwise. We show that any finite union of languages defined by m term trees is exactly identifiable in polynomial time using at most 2mn2 restricted subset queries and at most m + 1 equivalence queries, where n is the maximum size of counterexamples.