Probabilistic frequent subtrees for efficient graph classification and retrieval
From MaRDI portal
Recommendations
- Probabilistic and exact frequent subtree mining in graphs beyond forests
- Efficient frequent subtree mining beyond forests
- Efficient mining for structurally diverse subgraph patterns in large molecular databases
- Effective feature construction by maximum common subgraph sampling
- The Complexity of Mining Maximal Frequent Subgraphs
Cites work
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
- Faster Subtree Isomorphism
- Frequent Hypergraph Mining
- Frequent subtree mining -- an overview
- Hash kernels for structured data
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256746 (Why is no real title available?)
- Min-wise independent permutations
- On graph kernels: hardness results and efficient alternatives.
Cited in
(7)- gBoost: a mathematical programming approach to graph classification and regression
- Probabilistic and exact frequent subtree mining in graphs beyond forests
- Efficient frequent subtree mining beyond forests
- Full Perfect Extension Pruning for Frequent Subgraph Mining
- Effective feature construction by maximum common subgraph sampling
- Efficient mining for structurally diverse subgraph patterns in large molecular databases
- An uncertain graph classification algorithm based on discriminative subgraphs
This page was built for publication: Probabilistic frequent subtrees for efficient graph classification and retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1631835)
