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
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
Polynomial Time Inference of Extended Regular Pattern Languages
Proceedings of RIMS Symposium on Software Science and Engineering
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
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
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 Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
IEICE - Transactions on Information and Systems
A polynomial time algorithm for finding linear interval graph patterns
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Mining of frequent block preserving outerplanar graph structured patterns
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Polynomial time inductive inference of cograph pattern languages from positive data
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
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 linear ordered term tree, which is a rooted tree pattern consisting of ordered tree structures and internal structured variables with distinct variable labels. For a set of edge labels Λ, let OTTΛ be the set of all linear ordered term trees. For a linear ordered term tree t in OTTΛ, the term tree language of t, denoted by LΛ (t), is the set of all ordered trees obtained from t by substituting arbitrary ordered trees for all variables in t. Given a set of ordered trees S, the minimal language problem for OTTLΛ = {LΛ (t) | t ∈ OTTΛ} is to find a linear ordered term tree t in OTTΛ such that LΛ (t) is minimal among all term tree languages which contain all ordered trees in S. We show that the class OTTLΛ is polynomial time inductively inferable from positive data, by giving a polynomial time algorithm for solving the minimal language problem for OTTLΛ.