An efficiently computable subgraph pattern support measure: counting independent observations
From MaRDI portal
Publication:2435700
Recommendations
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach
- Support measures for graph data
- All normalized anti-monotonic overlap graph measures are bounded
- Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model
- Nearly exact mining of frequent trees in large networks
Cites work
- A comparison of the Delsarte and Lovász bounds
- All normalized anti-monotonic overlap graph measures are bounded
- Approximating semidefinite packing programs
- Emergence of Scaling in Random Networks
- Graph theory
- scientific article; zbMATH DE number 1256751 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Nearly exact mining of frequent trees in large networks
- On the Shannon capacity of a graph
- Probabilities on finite models
- Support measures for graph data
Cited in
(8)- Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach
- Mining frequent subgraphs in multigraphs
- G-Tries: a data structure for storing and finding subgraphs
- Mining weighted subgraphs in a single large graph
- All normalized anti-monotonic overlap graph measures are bounded
- Linear Programs with Conjunctive Database Queries
- CAGE: cache-aware graphlet enumeration
This page was built for publication: An efficiently computable subgraph pattern support measure: counting independent observations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2435700)
