Nearly exact mining of frequent trees in large networks (Q2435702)
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 6259861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nearly exact mining of frequent trees in large networks |
scientific article; zbMATH DE number 6259861 |
Statements
Nearly exact mining of frequent trees in large networks (English)
0 references
19 February 2014
0 references
graph mining
0 references
pattern mining
0 references
pattern matching
0 references
isomorphism
0 references
subgraph isomorphism
0 references
homomorphism
0 references
0.8145869374275208
0 references
0.8138444423675537
0 references
0.8024657368659973
0 references
0.8020614385604858
0 references
0.791979193687439
0 references
