Efficiently mining \(\delta \)-tolerance closed frequent subgraphs (Q413834)
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 6031574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently mining \(\delta \)-tolerance closed frequent subgraphs |
scientific article; zbMATH DE number 6031574 |
Statements
Efficiently mining \(\delta \)-tolerance closed frequent subgraphs (English)
0 references
8 May 2012
0 references
frequent subgraph mining
0 references
\(\delta \)-tolerance closedness
0 references
partial reverse search
0 references
0.7680767774581909
0 references
0.7607285976409912
0 references
0.7604618668556213
0 references
0.7582970857620239
0 references
0.7516480088233948
0 references
