Pages that link to "Item:Q2435702"
From MaRDI portal
The following pages link to Nearly exact mining of frequent trees in large networks (Q2435702):
Displaying 7 items.
- Finding supported paths in heterogeneous networks (Q1736715) (← links)
- A distributed approach for graph mining in massive networks (Q1741266) (← links)
- Mining blackhole and volcano patterns in directed graphs: a general approach (Q1945010) (← links)
- Probabilistic and exact frequent subtree mining in graphs beyond forests (Q2425250) (← links)
- An efficiently computable subgraph pattern support measure: counting independent observations (Q2435700) (← links)
- FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs (Q2865059) (← links)
- (Q5149013) (← links)