Probabilistic frequent subtrees for efficient graph classification and retrieval (Q1631835): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10994-017-5688-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2768237932 / rank | |||
Normal rank | |||
Revision as of 02:01, 20 March 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
