Mining top-\(k\) motifs with a SAT-based framework (Q511756)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mining top-k motifs with a SAT-based framework |
scientific article; zbMATH DE number 6687946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mining top-\(k\) motifs with a SAT-based framework |
scientific article; zbMATH DE number 6687946 |
Statements
Mining top-\(k\) motifs with a SAT-based framework (English)
0 references
22 February 2017
0 references
Boolean satisfiability
0 references
data mining
0 references
modeling
0 references
top-\(k\) motifs
0 references
0 references
0.7340387105941772
0 references
0.6877000331878662
0 references
0.6848982572555542
0 references
0.6840073466300964
0 references
0.677692711353302
0 references
