Pages that link to "Item:Q5045373"
From MaRDI portal
The following pages link to An Efficient Approach for Mining Frequent Subgraphs (Q5045373):
Displaying 11 items.
- Efficient algorithms for supergraph query processing on graph databases (Q630186) (← links)
- Distributed discovery of frequent subgraphs of a network using MapReduce (Q889838) (← links)
- Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
- Complete mining of frequent patterns from graphs: Mining graph data (Q1395734) (← links)
- Performance evaluation of frequent subgraph discovery techniques (Q1719279) (← links)
- Mining frequent subgraphs in multigraphs (Q2195360) (← links)
- The smallest valid extension-based efficient, rare graph pattern mining, considering length-decreasing support constraints and symmetry characteristics of graphs (Q2412349) (← links)
- FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs (Q2865059) (← links)
- Algorithm for mining approximate frequent subgraphs in a single graph (Q3306482) (← links)
- Full Perfect Extension Pruning for Frequent Subgraph Mining (Q3627910) (← links)
- The Complexity of Mining Maximal Frequent Subgraphs (Q5012510) (← links)
