Algorithm for mining approximate frequent subgraphs in a single graph (Q3306482)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7233807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm for mining approximate frequent subgraphs in a single graph |
scientific article; zbMATH DE number 7233807 |
Statements
12 August 2020
0 references
single graph
0 references
frequent-subgraph mining
0 references
pruning
0 references
Algorithm for mining approximate frequent subgraphs in a single graph (English)
0 references
0.7939215898513794
0 references
0.7484444975852966
0 references
0.7415249943733215
0 references
0.7272527813911438
0 references
0.7152858376502991
0 references
