DBScholar

Back to papers

Output Space Sampling for Graph Patterns

Summary: Metropolis-Hastings-based framework to sample the output space of frequent subgraphs in graph pattern mining. Demonstrates versatility across sampling strategies, yielding representative, discriminative, and scalable subgraphs for efficient graph mining. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h8a6def35d2825556
Venue
VLDB
Year
2009
Pagerank
6.0157118e-05
Overall Rank
5,729 | 61.49%
DOI
10.14778/1687627.1687710

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{hasan_vldb09,
        title = {{Output Space Sampling for Graph Patterns}},
        author = {Hasan, Mohammad Al and Zaki, Mohammed J.},
        journal = {PVLDB},
        series = {{VLDB} '09},
        doi = {10.14778/1687627.1687710},
        url = {https://doi.org/10.14778/1687627.1687710},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
6,773 GAIA: Graph Classification Using Evolutionary Computation 2010 SIGMOD 5.6860134e-05
8,342 Mining Top-k Pairs of Correlated Subgraphs in a Large Network 2020 VLDB 5.3516819e-05
11,581 Efficient Discovery of Significant Patterns with Few-Shot Resampling 2024 VLDB 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
473 Sampling Large Databases for Association Rules 1996 VLDB 0.00017673931
2,010 Mining Significant Graph Patterns by Leap Search 2008 SIGMOD 9.1914756e-05
3,383 Mining Compressed Frequent-Pattern Sets 2005 VLDB 7.3552126e-05
4,180 Traversing Itemset Lattices with Statistical Metric Pruning 2000 PODS 6.7554731e-05
Previous Page 1 / 1 Next

Semantically Similar Papers