GREW - a scalable frequent subgraph discovery algorithm

@article{Kuramochi2004GREWA,
  title={GREW - a scalable frequent subgraph discovery algorithm},
  author={Michihiro Kuramochi and George Karypis},
  journal={Fourth IEEE International Conference on Data Mining (ICDM'04)},
  year={2004},
  pages={439-442}
}
Existing algorithms that mine graph datasets to discover patterns corresponding to frequently occurring subgraphs can operate efficiently on graphs that are sparse, contain a large number of relatively small connected components, have vertices with low and bounded degrees, and contain well-labeled vertices and edges. However, for graphs that do not share these characteristics, these algorithms become highly unscalable. In this paper we present a heuristic algorithm called GREW to overcome the… CONTINUE READING
Highly Cited
This paper has 98 citations. REVIEW CITATIONS

6 Figures & Tables

Topics

Statistics

051015'05'07'09'11'13'15'17
Citations per Year

99 Citations

Semantic Scholar estimates that this publication has 99 citations based on the available data.

See our FAQ for additional information.