The Complexity of Mining Maximal Frequent Subgraphs
From MaRDI portal
Recommendations
- Mining frequent subgraphs in multigraphs
- An efficient approach for mining frequent subgraphs
- On the complexity of the maximum subgraph problem
- A fast algorithm for mining frequent subgraphs
- Computational aspects of mining maximal frequent patterns
- Algorithm for mining approximate frequent subgraphs in a single graph
- On the approximability of the maximum common subgraph problem
Cited in
(15)- COOMA: a components overlaid mining algorithm for enumerating connected subgraphs with common itemsets
- Frequent Hypergraph Mining
- A distributed approach for graph mining in massive networks
- Efficiently mining \(\delta \)-tolerance closed frequent subgraphs
- A general framework for mining frequent subgraphs from labeled graphs
- G-Tries: a data structure for storing and finding subgraphs
- Mine 'em all: a note on mining all graphs
- Probabilistic frequent subtrees for efficient graph classification and retrieval
- Hybrid ASP-based approach to pattern mining
- Frequent submap discovery
- The Parameterized Complexity of Enumerating Frequent Itemsets
- Enumerating teams in first-order team logics
- Computational aspects of mining maximal frequent patterns
- Efficient algorithms for the periodic subgraphs mining problem
- Nearly exact mining of frequent trees in large networks
This page was built for publication: The Complexity of Mining Maximal Frequent Subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012510)
