Implementing PLS for distance-based regression: computational issues (Q964602)
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: Implementing PLS for distance-based regression: computational issues |
scientific article; zbMATH DE number 5697288
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implementing PLS for distance-based regression: computational issues |
scientific article; zbMATH DE number 5697288 |
Statements
Implementing PLS for distance-based regression: computational issues (English)
0 references
22 April 2010
0 references
An algorithm is described for distance-based partial least squares regression. The proposed technique allows to calculate the principal coordinates avoiding explicit Euclidian configuration calculations which, for large datasets, are computationally expensive. Details of computer implementation are discussed for moderately large samples (of size \(\approx 10^4\)) when the distances matrix can be several gigabyte-sized. An application is considered to the problem of rate-making in automobile insurance.
0 references
multidimensional scaling
0 references
moderately large sample
0 references
partial least squares
0 references