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

Summary: Proposes a unified hypergraph framework for support measures in single-graph mining. Introduces MI and MVC measures; MI is linear-time computable; min-image-based measure bounds MI; MVC NP-hard but constant-factor approximable, with relaxations and bounds. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: ha6f11b349ab7c168
Venue: SIGMOD
Year: 2017
Pagerank: 5.4019783e-05
Overall Rank: 8,037 | 45.97%
DOI: 10.1145/3035918.3035936

Incoming Non-self Citations Over Time

Authors

1. Jinghan Meng (University of South Florida)
2. Yi-Cheng Tu (University of South Florida)

BibTeX Citation

@inproceedings{meng_sigmod17,
        title = {{Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs}},
        author = {Meng, Jinghan and Tu, Yi-Cheng},
        series = {{SIGMOD} '17},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3035918.3035936},
        url = {https://dl.acm.org/doi/10.1145/3035918.3035936},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,891	Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds	2025	VLDB	5.2559789e-05
10,786	MDS-FSM: Coverage-Based Frequent Subgraph Mining in Single Graphs	2026	VLDB	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
1,027	GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph	2014	VLDB	0.00012422544

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,059	Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees	2020	SIGMOD
2	6,642	Mining and Indexing Graphs for Supergraph Search	2013	VLDB
3	6,700	Data mining, Hypergraph Transversals, and Machine Learning	1997	PODS
4	5,478	Towards Proximity Pattern Mining in Large Graphs	2010	SIGMOD
5	5,729	Output Space Sampling for Graph Patterns	2009	VLDB
6	7,810	Mining Frequent Itemsets over Uncertain Databases	2012	VLDB
7	10,786	MDS-FSM: Coverage-Based Frequent Subgraph Mining in Single Graphs	2026	VLDB
8	3,383	Mining Compressed Frequent-Pattern Sets	2005	VLDB
9	8,891	Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds	2025	VLDB
10	7,668	The Complexity of Mining Maximal Frequent Subgraphs	2013	PODS