A fast algorithm for mining frequent subgraphs
From MaRDI portal
Recommendations
- FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
- Frequent mining of subgraph structures
- An efficient approach for mining frequent subgraphs
- Mining for unconnected frequent graphs with direct subgraph isomorphism tests
- A general framework for mining frequent subgraphs from labeled graphs
Cited in
(16)- scientific article; zbMATH DE number 1977808 (Why is no real title available?)
- Mining for unconnected frequent graphs with direct subgraph isomorphism tests
- Efficiently mining \(\delta \)-tolerance closed frequent subgraphs
- On the usefulness of weight-based constraints in frequent subgraph mining
- A general framework for mining frequent subgraphs from labeled graphs
- scientific article; zbMATH DE number 1977861 (Why is no real title available?)
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
- FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
- Algorithm for mining approximate frequent subgraphs in a single graph
- Frequent mining of subgraph structures
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- An efficient approach for mining frequent subgraphs
- An uncertain graph classification algorithm based on discriminative subgraphs
- Speedup for a periodic subgraph miner
- The Complexity of Mining Maximal Frequent Subgraphs
- Full Perfect Extension Pruning for Frequent Subgraph Mining
This page was built for publication: A fast algorithm for mining frequent subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5188877)
