Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Algorithm 39 Clusterwise linear regression

Algorithm 39 Clusterwise linear regression 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Computing Springer Journals

Algorithm 39 Clusterwise linear regression

Computing , Volume 22 (4) – Oct 25, 2005

Loading next page...
 
/lp/springer-journals/algorithm-39-clusterwise-linear-regression-M4JVOBDKgo

References (29)

Publisher
Springer Journals
Copyright
Copyright © 1979 by Springer-Verlag
Subject
Computer Science; Computer Science, general; Information Systems Applications (incl.Internet); Computer Communication Networks; Software Engineering; Artificial Intelligence; Computer Appl. in Administrative Data Processing
ISSN
0010-485X
eISSN
1436-5057
DOI
10.1007/BF02265317
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

ComputingSpringer Journals

Published: Oct 25, 2005

There are no references for this article.