Comparison of PLS algorithms when number of objects is much larger than number of variables (Q451312)
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 6085425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparison of PLS algorithms when number of objects is much larger than number of variables |
scientific article; zbMATH DE number 6085425 |
Statements
Comparison of PLS algorithms when number of objects is much larger than number of variables (English)
0 references
23 September 2012
0 references
high-dimensional data
0 references
kernel matrix
0 references
multicollinearity
0 references
multiple linear regression
0 references
NIPALS
0 references
partial least squares
0 references
SIMPLS
0 references
0 references
0.7906339764595032
0 references
0.7621176242828369
0 references
0.7621176242828369
0 references
0.7507033348083496
0 references
0.7497192621231079
0 references
