On the public citation graph

FS3: A sampling based method for top‐k frequent subgraph mining

0 signed · 61 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/sam.10004openalex-snapshot
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
inferredcites →https://doi.org/10.1007/11564126_39openalex-snapshot
A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston
inferredcites →https://doi.org/10.1007/11871637_10openalex-snapshot
Don’t Be Afraid of Simpler Patterns
inferredcites →https://doi.org/10.1007/3-540-45372-5_2openalex-snapshot
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
inferredcites →https://doi.org/10.1007/978-3-319-16112-9_2openalex-snapshot
Finding Network Motifs Using MCMC Sampling
inferredcites →https://doi.org/10.1007/978-3-540-73847-3_26openalex-snapshot
Frequent Hypergraph Mining
inferredcites →https://doi.org/10.1007/s10618-008-0098-xopenalex-snapshot
An integrated, generic approach to pattern mining: data mining template library
inferredcites →https://doi.org/10.1007/s10618-009-0162-1openalex-snapshot
Frequent subgraph mining in outerplanar graphs
inferredcites →https://doi.org/10.1016/j.entcs.2004.12.039openalex-snapshot
The Gaston Tool for Frequent Subgraph Mining
inferredcites →https://doi.org/10.1016/j.tcs.2010.03.030openalex-snapshot
Efficient frequent connected subgraph mining in graphs of bounded tree-width
inferredcites →https://doi.org/10.1093/bioinformatics/bth163openalex-snapshot
Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
inferredcites →https://doi.org/10.1093/bioinformatics/bti1049openalex-snapshot
Mining coherent dense subgraphs across massive biological networks for functional discovery
inferredcites →https://doi.org/10.1109/bigdata.2014.7004359openalex-snapshot
FS3: A sampling based method for top-k frequent subgraph mining
inferredcites →https://doi.org/10.1109/icde.2014.6816705openalex-snapshot
Large-scale frequent subgraph mining in MapReduce
inferredcites →https://doi.org/10.1109/icdm.2006.102openalex-snapshot
MARGIN: Maximal Frequent Subgraph Mining
inferredcites →https://doi.org/10.1109/tcbb.2006.51openalex-snapshot
Efficient Detection of Network Motifs
inferredcites →https://doi.org/10.1109/tkde.2004.33openalex-snapshot
An efficient algorithm for discovering frequent subgraphs
inferredcites →https://doi.org/10.1109/tkde.2005.127openalex-snapshot
Frequent substructure-based approaches for classifying chemical compounds
inferredcites →https://doi.org/10.1109/tkde.2014.2345408openalex-snapshot
An Iterative MapReduce Based Frequent Subgraph Mining Algorithm
inferredcites →https://doi.org/10.1137/1.9781611972795.56openalex-snapshot
M usk : Uniform Sampling of k Maximal Patterns
inferredcites →https://doi.org/10.1137/1.9781611972795.92openalex-snapshot
Near-optimal supervised feature selection among frequent subgraphs
inferredcites →https://doi.org/10.1145/1007568.1007607openalex-snapshot
Graph indexing
inferredcites →https://doi.org/10.1145/1014052.1014077openalex-snapshot
Towards parameter-free data mining
inferredcites →https://doi.org/10.1145/1014052.1014123openalex-snapshot
SPIN
inferredcites →https://doi.org/10.1145/1247480.1247574openalex-snapshot
Fg-index
inferredcites →https://doi.org/10.1145/1376616.1376662openalex-snapshot
Mining significant graph patterns by leap search
inferredcites →https://doi.org/10.1145/1774088.1774422openalex-snapshot
g-tries
inferredcites →https://doi.org/10.1145/1807167.1807262openalex-snapshot
GAIA
inferredcites →https://doi.org/10.1145/2629564openalex-snapshot
Efficiently Estimating Motif Statistics of Large Networks
inferredcites →https://doi.org/10.1145/956750.956784openalex-snapshot
CloseGraph
inferredcites →https://doi.org/10.1186/1471-2105-10-318openalex-snapshot
Kavosh: a new algorithm for finding network motifs
inferredcites →https://doi.org/10.1201/b10905-5openalex-snapshot
Optimal Proposal Distributions and Adaptive MCMC
inferredcites →https://doi.org/10.1214/ss/1177011136openalex-snapshot
Inference from Iterative Simulation Using Multiple Sequences
inferredcites →https://doi.org/10.14778/1687627.1687710openalex-snapshot
Output space sampling for graph patterns
inferredcites →https://doi.org/10.1561/9781933019772openalex-snapshot
Mathematical Aspects of Mixing Times in Markov Chains
inferredcites →https://doi.org/10.1613/jair.43openalex-snapshot
Substructure Discovery Using Minimum Description Length and Background Knowledge
inferredcites →https://doi.org/10.7155/jgaa.00247openalex-snapshot
FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/widm.1226openalex-snapshot
Triangle counting in large networks: a review
inferred← citeshttps://doi.org/10.1002/widm.1454openalex-snapshot
Subgraph mining in a large graph: A review
inferred← citeshttps://doi.org/10.1007/978-3-031-74633-8_7openalex-snapshot
Wave Top-k Random-d Family Search: How to Guide an Expert in a Structured Pattern Space
inferred← citeshttps://doi.org/10.1007/978-3-319-94105-9_5openalex-snapshot
Using Subgraph Distributions for Characterizing Networks and Fitting Random Graph Models
inferred← citeshttps://doi.org/10.1007/978-981-13-1498-8_35openalex-snapshot
Frequent Subpatterns Distribution in Social Network Analysis
inferred← citeshttps://doi.org/10.1007/s10115-017-1109-2openalex-snapshot
Mining exceptional closed patterns in attributed graphs
inferred← citeshttps://doi.org/10.1007/s10618-024-01037-8openalex-snapshot
WaveLSea: helping experts interactively explore pattern mining search spaces
inferred← citeshttps://doi.org/10.1007/s13278-020-00682-3openalex-snapshot
Online social network trend discovery using frequent subgraph mining
inferred← citeshttps://doi.org/10.1007/s44196-021-00001-4openalex-snapshot
A Graph Mining Approach for Ranking and Discovering the Interesting Frequent Subgraph Patterns
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.122554openalex-snapshot
Supports estimation via graph sampling
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.123971openalex-snapshot
HE-Gaston algorithm for frequent subgraph mining with hadoop framework
inferred← citeshttps://doi.org/10.1038/s41598-024-54894-0openalex-snapshot
7 Dimensions of software change patterns
inferred← citeshttps://doi.org/10.1109/access.2018.2846604openalex-snapshot
Optimized and Frequent Subgraphs: How Are They Related?
inferred← citeshttps://doi.org/10.1109/access.2023.3257887openalex-snapshot
Mining Top-k Frequent Patterns in Large Geosocial Networks: A Mnie-Based Extension Approach
inferred← citeshttps://doi.org/10.1109/asonam.2016.7752414openalex-snapshot
Towards using subpattern distributions in Social Network Analysis
inferred← citeshttps://doi.org/10.1109/tcbb.2017.2756879openalex-snapshot
Discovery of Functional Motifs from the Interface Region of Oligomeric Proteins Using Frequent Subgraph Mining
inferred← citeshttps://doi.org/10.1109/tse.2023.3269500openalex-snapshot
FS3change: A Scalable Method for Change Pattern Mining
inferred← citeshttps://doi.org/10.1145/3195106.3195166openalex-snapshot
An Efficient Ranking Scheme for Frequent Subgraph Patterns
inferred← citeshttps://doi.org/10.1145/3269206.3271772openalex-snapshot
Mining Frequent Patterns in Evolving Graphs
inferred← citeshttps://doi.org/10.1145/3559009.3569658openalex-snapshot
SampleMine
inferred← citeshttps://doi.org/10.1287/educ.2016.0147openalex-snapshot
Methods and Applications of Network Sampling
inferred← citeshttps://doi.org/10.59277/romjist.2023.1.01openalex-snapshot
A Frequent Construction Mining Scheme Based on Syntax Tree
inferred← citeshttps://doi.org/10.70675/52cc84b4z45c7z4edez8dcbz73e425a27252openalex-snapshot
Mining useful patterns in attributed graphs
inferred← citeshttps://doi.org/10.70675/d7b0e5acz2332z4eedz9db0z83320a46ae99openalex-snapshot
Querying and Mining Multigraphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.