Finding top-\(N\) colossal patterns based on clique search with dynamic update of graph (Q2907473)
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: Finding top-N colossal patterns based on clique search with dynamic update of graph |
scientific article; zbMATH DE number 6080075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding top-\(N\) colossal patterns based on clique search with dynamic update of graph |
scientific article; zbMATH DE number 6080075 |
Statements
Finding Top-N Colossal Patterns Based on Clique Search with Dynamic Update of Graph (English)
0 references
10 September 2012
0 references
colossal patterns
0 references
maximal patterns
0 references
pattern graph
0 references
cliques
0 references
0.7037546038627625
0 references
0.6951572895050049
0 references
0.6929665207862854
0 references
0.6898577809333801
0 references
