FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs (Q2865059)
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 6234170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs |
scientific article; zbMATH DE number 6234170 |
Statements
28 November 2013
0 references
frequent pattern mining
0 references
frequent subgraph
0 references
graph database
0 references
graph mining
0 references
maximal frequent subgraph
0 references
maximum common subgraph
0 references
FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs (English)
0 references
0.8411484956741333
0 references
0.836416482925415
0 references
0.8129934072494507
0 references
0.8024657368659973
0 references
