Pages that link to "Item:Q982649"
From MaRDI portal
The following pages link to Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649):
Displaying 9 items.
- Efficiently mining \(\delta \)-tolerance closed frequent subgraphs (Q413834) (← links)
- Probabilistic frequent subtrees for efficient graph classification and retrieval (Q1631835) (← links)
- On maximum common subgraph problems in series-parallel graphs (Q1678090) (← links)
- Probabilistic and exact frequent subtree mining in graphs beyond forests (Q2425250) (← links)
- Nearly exact mining of frequent trees in large networks (Q2435702) (← links)
- Mine ’Em All: A Note on Mining All Graphs (Q2827475) (← links)
- Efficient pattern matching on graph patterns of bounded treewidth (Q2840694) (← links)
- Full Perfect Extension Pruning for Frequent Subgraph Mining (Q3627910) (← links)
- COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets (Q5227496) (← links)