Pages that link to "Item:Q5012510"
From MaRDI portal
The following pages link to The Complexity of Mining Maximal Frequent Subgraphs (Q5012510):
Displaying 11 items.
- Efficiently mining \(\delta \)-tolerance closed frequent subgraphs (Q413834) (← links)
- Probabilistic frequent subtrees for efficient graph classification and retrieval (Q1631835) (← links)
- A distributed approach for graph mining in massive networks (Q1741266) (← links)
- Enumerating teams in first-order team logics (Q2172832) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- Efficient algorithms for the periodic subgraphs mining problem (Q2376786) (← links)
- Nearly exact mining of frequent trees in large networks (Q2435702) (← links)
- G-Tries: a data structure for storing and finding subgraphs (Q2435716) (← links)
- Computational aspects of mining maximal frequent patterns (Q2508965) (← links)
- Hybrid ASP-based Approach to Pattern Mining (Q4957187) (← links)
- COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets (Q5227496) (← links)
