Pages that link to "Item:Q2865059"
From MaRDI portal
The following pages link to FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs (Q2865059):
Displaying 13 items.
- Efficiently mining \(\delta \)-tolerance closed frequent subgraphs (Q413834) (← links)
- Distributed discovery of frequent subgraphs of a network using MapReduce (Q889838) (← links)
- Complete mining of frequent patterns from graphs: Mining graph data (Q1395734) (← links)
- Performance evaluation of frequent subgraph discovery techniques (Q1719279) (← links)
- A distributed approach for graph mining in massive networks (Q1741266) (← links)
- Cost and accuracy aware scientific workflow retrieval based on distance measure (Q1749198) (← links)
- Speedup for a periodic subgraph miner (Q1944940) (← links)
- Mining frequent subgraphs in multigraphs (Q2195360) (← links)
- Efficient algorithms for the periodic subgraphs mining problem (Q2376786) (← links)
- The smallest valid extension-based efficient, rare graph pattern mining, considering length-decreasing support constraints and symmetry characteristics of graphs (Q2412349) (← links)
- Nearly exact mining of frequent trees in large networks (Q2435702) (← links)
- Algorithm for mining approximate frequent subgraphs in a single graph (Q3306482) (← links)
- An Efficient Approach for Mining Frequent Subgraphs (Q5045373) (← links)
