×

A fast algorithm for clusterwise linear regression. (English) Zbl 0485.65030


MSC:

65F20 Numerical solutions to overdetermined systems, pseudoinverses
65C99 Probabilistic methods, stochastic differential equations
62J05 Linear regression; mixed models
62H30 Classification and discrimination; cluster analysis (statistical aspects)

Citations:

Zbl 0387.65028

Software:

Algorithm 39; AS 75
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Daniel, J. W., Gragg, W. B., Kaufman, L., Stewart, G. W.: Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comp.30, 722–795 (1976). · Zbl 0345.65021
[2] Gentleman, M. W.: Least squares computations by Givens transformations without square roots. J. Inst. Maths Applics12, 329–336 (1973). · Zbl 0289.65020 · doi:10.1093/imamat/12.3.329
[3] Gentleman, M. W.: Algorithm AS 75. Basic procedures for large, sparse or weighted least squares problems. Appl. Statist.23, 448–454 (1974). · doi:10.2307/2347147
[4] Gragg, W. B., Leveque, R. J., Trangenstein, J. A.: Numerically stable methods for updating regressions. J. Am. Statist. Ass.74, 161–168 (1979). · Zbl 0398.62058 · doi:10.2307/2286746
[5] Späth, H.: Algorithm 39. Clusterwise linear regression. Computing22, 367–373 (1979). · Zbl 0387.65028 · doi:10.1007/BF02265317
[6] Späth, H.: Cluster analysis algorithms for data reduction and classification of objects. Chichester 1980. · Zbl 0435.62059
[7] Späth, H.: correction to Algorithm 39. Clusterwise linear regression. Computing26, 275 (1981). · Zbl 0444.65020 · doi:10.1007/BF02243486
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.