{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:46:55Z","timestamp":1778154415654,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1979,12]]},"DOI":"10.1007\/bf02265317","type":"journal-article","created":{"date-parts":[[2005,12,9]],"date-time":"2005-12-09T01:16:12Z","timestamp":1134090972000},"page":"367-373","source":"Crossref","is-referenced-by-count":179,"title":["Algorithm 39 Clusterwise linear regression","Algorithmus 39. Klassenweise lineare Regression"],"prefix":"10.1007","volume":"22","author":[{"given":"H.","family":"Sp\u00e4th","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02265317_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02162565","volume":"8","author":"I. Barrodale","year":"1966","unstructured":"Barrodale, I., Young, A.: Algorithms for bestL 1 andL \u221e linear approximation on a discrete set. Numer. Math.8, 295\u2013306 (1966).","journal-title":"Numer. Math."},{"key":"BF02265317_CR2","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1137\/0710069","volume":"10","author":"I. Barrodale","year":"1973","unstructured":"Barrodale, I., Young, A.: An improved algorithm for discreteL 1 linear approximation. SIAM J. Numer. An.10, 839\u2013848 (1973).","journal-title":"SIAM J. Numer. An."},{"key":"BF02265317_CR3","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01934207","volume":"10","author":"P. A. Businger","year":"1970","unstructured":"Businger, P. A.: Updating a singular value decomposition. BIT10, 376\u2013397 (1970).","journal-title":"BIT"},{"key":"BF02265317_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02252193","volume":"21","author":"L. Cromme","year":"1978","unstructured":"Cromme, L.: Zur praktischen Behandlung linearer diskreter Approximationsprobleme in der Maximumsnorm. Computing21, 37\u201352 (1978).","journal-title":"Computing"},{"key":"BF02265317_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-88169-5","volume-title":"Sensitivit\u00e4tsanalysen und parametrische Programmierung","author":"W. Dinkelbach","year":"1969","unstructured":"Dinkelbach, W.: Sensitivit\u00e4tsanalysen und parametrische Programmierung. Berlin-Heidelberg-New York: Springer 1969."},{"key":"BF02265317_CR6","volume-title":"Fallstudien Cluster-Analyse","author":"H. Fakiner","year":"1977","unstructured":"Fakiner, H., Krieger, E., Rohmeier, H.: Regional differenzierte Analyse und Prognose des Wasserbedafs der privaten Haushalte in der Bundesrepublik Deutschland. In: Fallstudien Cluster-Analyse (Sp\u00e4th, H., Hrsg.). M\u00fcnchen: R. Oldenbourg 1977."},{"key":"BF02265317_CR7","first-page":"772","volume":"30","author":"J. W. Daniel","year":"1976","unstructured":"Daniel, J. W., Gragg, W. B., Kaufman, L., Stewart, G. W.: Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. of Comput.30, 772\u2013795 (1976).","journal-title":"Math. of Comput."},{"key":"BF02265317_CR8","volume-title":"Solving least squares problems","author":"C. L. Lawson","year":"1974","unstructured":"Lawson, C. L., Hanson, R. J.: Solving least squares problems. Englewood Cliffs: Prentice-Hall 1974."},{"key":"BF02265317_CR9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02253335","volume":"12","author":"G. Merle","year":"1974","unstructured":"Merle, G., Sp\u00e4th, H.: Computational experiences with discreteL p-approximation. Computing12, 315\u2013321 (1974).","journal-title":"Computing"},{"key":"BF02265317_CR10","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF01932691","volume":"15","author":"W. Rey","year":"1975","unstructured":"Rey, W.: On leastp-th power methods in multiple regressions and location estimations. BIT15, 174\u2013185 (1975).","journal-title":"BIT"},{"key":"BF02265317_CR11","unstructured":"Schittkowski, K., Stoer, J.: A factorization method for constrained least squares prolems with data changes, part 1: theory. Preprint No. 20, Institut f\u00fcr Angewandte Mathematik und Statistik, Universit\u00e4t W\u00fcrzburg, 1976. [See also: Numer. math.31, 431\u2013463 (1979).]"},{"key":"BF02265317_CR12","unstructured":"Schittkowski, K., Zimmermann, P.: A factorization method for constrained least squares problems with data changes, part 2: numerical tests, comparisons and ALGOL-codes. Preprint No. 30, Institut f\u00fcr Angewandte Mathematik und Statistik, Universit\u00e4t W\u00fcrzburg, 1977."},{"key":"BF02265317_CR13","volume-title":"Algorithmen f\u00fcr multivariable Ausgleichmsodelle","author":"H. Sp\u00e4th","year":"1974","unstructured":"Sp\u00e4th, H.: Algorithmen f\u00fcr multivariable Ausgleichmsodelle. M\u00fcnchen: R. Oldenbourg 1974."},{"key":"BF02265317_CR14","volume-title":"Cluster-Analyse-Algorithmen","author":"H. Sp\u00e4th","year":"1977","unstructured":"Sp\u00e4th, H.: Cluster-Analyse-Algorithmen, 2. Aufl. M\u00fcnchen: R. Oldenburg 1977. (English traslation: Cluster analysis algorithms. Chichester: Horwood 1979.)","edition":"2. Aufl"},{"key":"BF02265317_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0377-2217(77)81005-9","volume":"1","author":"H. Sp\u00e4th","year":"1977","unstructured":"Sp\u00e4th, H.: Computational experiences with the exchange method apllied to four commonly used partitioning cluster analysis criteria. Europ. J. Op. Res.1, 23\u201331 (1977).","journal-title":"Europ. J. Op. Res."},{"key":"BF02265317_CR16","series-title":"ISNM","volume-title":"Numerische Methoden bei graphentheoretischen und kombinatorischen problemen, Band 2","author":"H. Sp\u00e4th","year":"1979","unstructured":"Sp\u00e4th, H.: Klassenweise diskrete Approximation. In: Numerische Methoden bei graphentheoretischen und kombinatorischen problemen, Band 2, ISNM Vol. 46. (Collatz, L., Meinardus, G., Wetterling, W., Hrsg.). Basel-Stuttgart: Birkh\u00e4user 1979."},{"key":"BF02265317_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06864-9","volume-title":"Einf\u00fchrung in die Numerische Mathematik I","author":"J. Stoer","year":"1976","unstructured":"Stoer, J.: Einf\u00fchrung in die Numerische Mathematik I, 2. Aufl. Berlin-Heidelberg-New York: Springer 1976.","edition":"2. Aufl"},{"key":"BF02265317_CR18","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02253212","volume":"18","author":"G. A. Watson","year":"1977","unstructured":"Watson, G. A.: On two methods for discreteL p approximation. Computing18, 263\u2013266 (1977).","journal-title":"Computing"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02265317.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02265317\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02265317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:50:53Z","timestamp":1557942653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02265317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["BF02265317"],"URL":"https:\/\/doi.org\/10.1007\/bf02265317","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}