Identifying frequent items in distributed data sets (Q488300)
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: Identifying frequent items in distributed data sets |
scientific article; zbMATH DE number 6390365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identifying frequent items in distributed data sets |
scientific article; zbMATH DE number 6390365 |
Statements
Identifying frequent items in distributed data sets (English)
0 references
26 January 2015
0 references
frequency
0 references
aggregation
0 references
gossip-based algorithms
0 references
frequent items discovery
0 references
most frequent items in large-scale distributed datasets
0 references
0.8906909823417664
0 references
0.7976036667823792
0 references
0.7864227890968323
0 references
0.7740636467933655
0 references
