Probabilistic frequent subtrees for efficient graph classification and retrieval (Q1631835): Difference between revisions
From MaRDI portal
Latest revision as of 14:20, 17 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Probabilistic frequent subtrees for efficient graph classification and retrieval |
scientific article |
Statements
Probabilistic frequent subtrees for efficient graph classification and retrieval (English)
0 references
7 December 2018
0 references
pattern mining
0 references
frequent subgraph mining
0 references
frequent subtree mining
0 references
probabilistic subtrees
0 references
efficient embedding computation
0 references
MIN-hashing
0 references