Probabilistic frequent subtrees for efficient graph classification and retrieval (Q1631835): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q432250 |
||
| Property / author | |||
| Property / author: Tamás L. Horváth / rank | |||
Revision as of 00:17, 15 February 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
