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
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
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
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
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
| Hi-index | 0.00 |
In the fields of data mining and knowledge discovery, many semistructured data such as HTML/XML files are represented by rooted trees t such that all children of each internal vertex of t are ordered and t has edge labels. In order to represent structural features common to such semistructured data, we propose a regular term tree which is a rooted tree pattern consisting of ordered tree structures and internal structured variables. For a regular ordered term tree t, the term tree language of t, denoted by L(t), is the set of all trees which are obtained from t by substituting arbitrary trees for all variables in t.In this paper, we consider a polynomial time learnability of the class OTTL = {L(t) | t 驴 OTT } from positive data, where OTT denotes the set of all regular ordered term trees. First of all, we present a polynomial time algorithm for solving the minimal language problem for OTT which is, given a set of labeled trees S, to find a term tree t in OTT such that L(t) is minimal among all term tree languages which contain all trees in S. Moreover, by using this algorithm and the polynomial time algorithm for solving the membership problem for OTT in our previous work [15], we show that OTTL is polynomial time inductively inferable from positive data. This result is an extension of our previous results in [14].