Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs

Jinghan Meng1, Yi-Cheng Tu1

  • 1Department of Computer Science & Engineering, University of South Florida.

Proceedings. ACM-SIGMOD International Conference on Management of Data
|March 1, 2024
PubMed
Summary

This study introduces a new hypergraph framework for graph mining, unifying existing support measures and proposing novel minimum instance (MI) and minimum vertex cover (MVC) measures for more effective frequent pattern discovery in single graphs.