Sufficient dimension reduction via random-partitions for the large-\(p\)-small-\(n\) problem (Q5214469)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7165159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sufficient dimension reduction via random-partitions for the large-\(p\)-small-\(n\) problem |
scientific article; zbMATH DE number 7165159 |
Statements
Sufficient dimension reduction via random‐partitions for the large‐<i>p</i>‐small‐<i>n</i> problem (English)
0 references
7 February 2020
0 references
distance correlation screening
0 references
randomized algorithm
0 references
random-partition
0 references
random sketching
0 references
sufficient dimension reduction
0 references
sure screening property
0 references
0.801770031452179
0 references
0.7948400974273682
0 references
0.7884843945503235
0 references
0.7787551283836365
0 references
0.7773493528366089
0 references
