Inferring decision trees using the minimum description length principle
Information and Computation
Integrating association rule mining with relational database systems: alternatives and implications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Machine Learning
IEEE Intelligent Systems
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
gSpan: Graph-Based Substructure Pattern Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Performance evaluation and analysis of K-way join variants for association rule mining
BNCOD'03 Proceedings of the 20th British national conference on Databases
HDB-Subdue: A Scalable Approach to Graph Mining
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Efficient algorithms based on relational queries to mine frequent graphs
PIKM '10 Proceedings of the 3rd workshop on Ph.D. students in information and knowledge management
Using substructure mining to identify misbehavior in network provenance graphs
First International Workshop on Graph Data Management Experiences and Systems
Hi-index | 0.00 |
This paper addresses subtle aspects of graph mining using an SQL-based approach. The enhancements addressed in this paper include detection of cycles, effect of overlapping substructures on compression, and development of a minimum description length for the relational approach. Extensive performance evaluation has been conducted to evaluate the extensions.