Finding Topological Frequent Patterns from Graph Datasets
Michihiro Kuramochi, George Karypis · 2006
This chapter contains sections titled: Introduction Background Definitions and Notation Frequent Pattern Discovery from Graph Datasets—Problem Definitions FSG for the Graph-Transaction Setting SIGRAM for the Single-Graph Setting GREW—Scalable Frequent Subgraph Discovery Algorithm Related Research Conclusions References