Linear-time computation of optimal subgraphs of decomposable graphs
Journal of Algorithms
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
On an algorithm of Zemlyachenko for subtree isomorphism
Information Processing Letters
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Dynamic Programming on Graphs with Bounded Treewidth
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment
TOOLS '99 Proceedings of the 31st International Conference on Technology of Object-Oriented Language and Systems
gSpan: Graph-Based Substructure Pattern Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Indexing and Mining Free Trees
ICDM '03 Proceedings of the Third 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
Frequent free tree discovery in graph data
Proceedings of the 2004 ACM symposium on Applied computing
Note: Symmetry in complex networks
Discrete Applied Mathematics
An assessment of submissions made to the predictive toxicology evaluation challenge
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
gPrune: a constraint pushing framework for graph pattern mining
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Constraint-Based graph mining in large database
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
| Hi-index | 0.00 |
The area of graph mining bears great importance when dealing with semi-structured data such as XML, text and chemical and genetic data. One of the main challenges of this field is that out of many resulting frequent subgraphs it is hard to find interesting ones. We propose a novel algorithm that finds subgraphs of limited diameter and high symmetry. These subgraphs represent the more structurally interesting patterns in the database. Our approach also allows to decrease processing time drastically by employing the tree decomposition structure of database graphs during the discovery process.