Pages that link to "Item:Q2435700"
From MaRDI portal
The following pages link to An efficiently computable subgraph pattern support measure: counting independent observations (Q2435700):
Displaying 7 items.
- All normalized anti-monotonic overlap graph measures are bounded (Q408673) (← links)
- Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model (Q1741393) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- Mining frequent subgraphs in multigraphs (Q2195360) (← links)
- G-Tries: a data structure for storing and finding subgraphs (Q2435716) (← links)
- Mining weighted subgraphs in a single large graph (Q2660705) (← links)
- Linear Programs with Conjunctive Database Queries (Q6151558) (← links)