The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
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
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Discovering New Knowledge from Graph Data Using Inductive Logic Programming
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
Ordered term tree languages which are polynomial time inductively inferable from positive data
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Frequent subgraph mining in outerplanar graphs
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Exact Learning of Finite Unions of Graph Patterns from Queries
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
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 TTSP graph languages from positive data
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
| Hi-index | 0.00 |
An outerplanar graph is a planar graph which can be embedded in the plane in such a way that all of vertices lie on the outer boundary. Many chemical compounds are known to be expressed by outerplanar graphs. We proposed a block preserving outerplanar graph pattern (bpo- graph pattern, for short) as a graph pattern common to a set of outerplanar graphs like a dataset of chemical compounds. In this paper, firstly we give a polynomial time algorithm for finding a minimally generalized bpo- graph pattern explaining a given set of outerplanar graphs. Secondly we give a pattern mining algorithm for enumerating all maximal frequent bpo- graph patterns in a set of outerplanar graphs. Finally, in order to show the performance of the pattern mining algorithm, we report experimental results on chemical datasets.