Using balanced iterative reducing and clustering hierarchies to compute approximate rank statistics on massive datasets (Q5219487)
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: Using balanced iterative reducing and clustering hierarchies to compute approximate rank statistics on massive datasets |
scientific article; zbMATH DE number 7179583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using balanced iterative reducing and clustering hierarchies to compute approximate rank statistics on massive datasets |
scientific article; zbMATH DE number 7179583 |
Statements
Using balanced iterative reducing and clustering hierarchies to compute approximate rank statistics on massive datasets (English)
0 references
12 March 2020
0 references
correlation
0 references
rank statistics
0 references
massive dataset
0 references
Kendall's \(\tau \)
0 references
Spearman's \(\rho \)
0 references
BIRCH
0 references
0 references
0 references
0.8666559
0 references
0.85399234
0 references
0.85090363
0 references
0.8492262
0 references
0.8489455
0 references
0.84622705
0 references
0.8412452
0 references
0.8392581
0 references
