Pages that link to "Item:Q2194034"
From MaRDI portal
The following pages link to Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034):
Displaying 4 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)
- The smallest valid extension-based efficient, rare graph pattern mining, considering length-decreasing support constraints and symmetry characteristics of graphs (Q2412349) (← links)
- An efficiently computable subgraph pattern support measure: counting independent observations (Q2435700) (← links)