Exact fast computation of band depth for large functional datasets: how quickly can one million curves be ranked? (Q6537825)
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: Exact fast computation of band depth for large functional datasets: how quickly can one million curves be ranked? |
scientific article; zbMATH DE number 7847460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact fast computation of band depth for large functional datasets: how quickly can one million curves be ranked? |
scientific article; zbMATH DE number 7847460 |
Statements
Exact fast computation of band depth for large functional datasets: how quickly can one million curves be ranked? (English)
0 references
14 May 2024
0 references
approximate solution
0 references
band depth
0 references
exact solution
0 references
functional boxplot
0 references
functional data
0 references
large dataset
0 references
modified band depth
0 references
