CLUSTERWISE LINEAR-REGRESSION

被引：125

作者：

SPATH, H

机构：

[1] Fachbereich IV, Universität Oldenburg, Oldenburg, D-2900

来源：

COMPUTING | 1979年 / 22卷 / 04期

关键词：

D O I：

10.1007/BF02265317

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The combinatorial problem of clusterwise discrete linear approximation is defined as finding a given number of clusters of observations such that the overall sum of error sum of squares within those clusters becomes a minimum. The FORTRAN implementation of a heuristic solution method and a numerical example are given. © 1979 Springer-Verlag.

引用

收藏

页码：367 / 373

页数：7

相关论文

共 19 条

[1] ALGORITHMS FOR BEST L1 AND LINFINITY LINEAR APPROXIMATIONS ON A DISCRETE SET [J].

BARRODALE, I ;

YOUNG, A .

NUMERISCHE MATHEMATIK, 1966, 8 (03) :295-+

[2] IMPROVED ALGORITHM FOR DISCRETE L1 LINEAR-APPROXIMATION [J].

BARRODALE, I ;

ROBERTS, FDK .

SIAM JOURNAL ON NUMERICAL ANALYSIS, 1973, 10 (05) :839-848

[3]

Bussinger P.A, 1970, BIT, V10, P376, DOI DOI 10.1007/BF01934207

[4] CALCULATION OF DISCRETE LINEAR MAXIMUM NORM APPROXIMATIONS [J].

CROMME, L .

COMPUTING, 1978, 21 (01) :37-52

[5] REORTHOGONALIZATION AND STABLE ALGORITHMS FOR UPDATING GRAM-SCHMIDT QR FACTORIZATION [J].

DANIEL, JW ;

GRAGG, WB ;

KAUFMAN, L ;

STEWART, GW .

MATHEMATICS OF COMPUTATION, 1976, 30 (136) :772-795

[6]

Dinkelbach W., 1969, SENSITIVITATSANALYSE

[7]

FAKINER H, 1977, FALLSTUDIEN CLUSTERA

[8]

Lawson CL., 1974, SOLVING LEAST SQUARE

[9] COMPUTATIONAL EXPERIENCES WITH DISCRETE LP-APPROXIMATION [J].

MERLE, G ;

SPATH, H .

COMPUTING, 1974, 12 (04) :315-321

[10]

Rey W., 1975, BIT (Nordisk Tidskrift for Informationsbehandling), V15, P174, DOI 10.1007/BF01932691