Sufficient dimension reduction via random‐partitions for the large‐<i>p</i>‐small‐<i>n</i> problem (Q5214469)
From MaRDI portal
scientific article; zbMATH DE number 7165159
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sufficient dimension reduction via random‐partitions for the large‐<i>p</i>‐small‐<i>n</i> 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
