Extracting schema from semistructured data
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Exact learning of unordered tree patterns from queries
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Discovering Structural Association of Semistructured Data
IEEE Transactions on Knowledge and Data Engineering
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
Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
On Learning Unions of Pattern Languages and Tree Patterns
ALT '99 Proceedings of the 10th 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
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
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
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
ILP '08 Proceedings of the 18th 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
Polynomial time inductive inference of TTSP graph languages from positive data
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
A bit-parallel tree matching algorithm for patterns with horizontal VLDC's
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to extract meaningful and hidden knowledge from such tree structured documents, we consider a minimal language (MINL) problem for term trees. The MINL problem for term trees is to find a term tree t such that the language generated by t is minimal among languages, generated by term trees, which contain all given tree structured data. Firstly, we show that the MINL problem for regular term trees is computable in polynomial time if the number of edge labels is infinite. Next, we show that the MINL problems with optimizing the size of an output term tree are NP-complete. Finally, in order to show that our polynomial time algorithm for the MINL problem can be applied to data mining from real-world Web documents, we show that regular term tree languages are polynomial time inductively inferable from positive data if the number of edge labels is infinite.