Computational geometry: an introduction
Computational geometry: an introduction
Fundamentals of digital image processing
Fundamentals of digital image processing
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Learning Function-Free Horn Expressions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Data Structures and Algorithms
Data Structures and Algorithms
Efficient generation of plane trees
Information Processing Letters
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering Frequent Geometric Subgraphs
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
CloseGraph: mining closed frequent graph patterns
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
XRules: an effective structural classifier for XML data
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
State of the art of graph-based data mining
ACM SIGKDD Explorations Newsletter
BIDE: Efficient Mining of Frequent Closed Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
The complexity of mining maximal frequent itemsets and maximal frequent patterns
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
DRYADE: A New Approach for Discovering Closed Frequent Trees in Heterogeneous Tree Databases
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Clustering graphs by weighted substructure mining
ICML '06 Proceedings of the 23rd international conference on Machine learning
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
On mining closed sets in multi-relational data
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An output-polynomial time algorithm for mining frequent closed attribute trees
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Mining frequent closed patterns in pointset databases
Information Systems
Efficient algorithms for mining frequent and closed patterns from semi-structured data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
A new proposal for graph classification using frequent geometric subgraphs
Data & Knowledge Engineering
| Hi-index | 0.00 |
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scaling. While Kuramochi and Karypis (ICDM2002) extensively studied the frequent pattern mining problem for geometric subgraphs, the maximal graph mining has not been considered so far. In this paper, we study the maximal (or closed) graph mining problem for the general class of geometric graphs in the 2D plane by extending the framework of Kuramochi and Karypis. Combining techniques of canonical encoding and a depth-first search tree for the class of maximal patterns, we present a polynomial delay and polynomial space algorithm, MaxGeo, that enumerates all maximal subgraphs in a given input geometric graph without duplicates. This is the first result establishing the output-sensitive complexity of closed graph mining for geometric graphs. We also show that the frequent graph mining problem is also solvable in polynomial delay and polynomial time.