An uncertain graph classification algorithm based on discriminative subgraphs
From MaRDI portal
Publication:5260745
Recommendations
- A fast algorithm for mining frequent subgraphs
- Probabilistic and exact frequent subtree mining in graphs beyond forests
- Mining discriminative subgraph patterns from structural data
- Probabilistic frequent subtrees for efficient graph classification and retrieval
- A general framework for mining frequent subgraphs from labeled graphs
Cited in
(2)
This page was built for publication: An uncertain graph classification algorithm based on discriminative subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5260745)