Segmented Least Squares

Michal Mankowski; Mikhail Moshkov

doi:10.1007/978-3-030-63920-4_13

Segmented Least Squares

Michal Mankowski^*, Mikhail Moshkov

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

The least squares method is widely used in statistics with common application to regression. The aim is to fit a linear function to set of points that minimizes the sum of the squares of the residuals. In some cases, fitting a linear function with a relatively small error is impossible. Keeping the linear character of approximation, the data points can be split into a sequence of segments, where to each of the segments the line given by a linear function is fitted. The optimization objectives for this problem is to minimize the total least squares error for all segments and to minimize the number of segments used. We refer to such a problem as segmented least squares.

Original language	English (US)
Title of host publication	Studies in Systems, Decision and Control
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	147-156
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-030-63920-4_13
State	Published - 2021

Publication series

Name	Studies in Systems, Decision and Control
Volume	331
ISSN (Print)	2198-4182
ISSN (Electronic)	2198-4190

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.

ASJC Scopus subject areas

Computer Science (miscellaneous)
Control and Systems Engineering
Automotive Engineering
Social Sciences (miscellaneous)
Economics, Econometrics and Finance (miscellaneous)
Control and Optimization
Decision Sciences (miscellaneous)

Access to Document

10.1007/978-3-030-63920-4_13

Cite this

@inbook{a995fa4601c146f4a87d843345f8d498,

title = "Segmented Least Squares",

abstract = "The least squares method is widely used in statistics with common application to regression. The aim is to fit a linear function to set of points that minimizes the sum of the squares of the residuals. In some cases, fitting a linear function with a relatively small error is impossible. Keeping the linear character of approximation, the data points can be split into a sequence of segments, where to each of the segments the line given by a linear function is fitted. The optimization objectives for this problem is to minimize the total least squares error for all segments and to minimize the number of segments used. We refer to such a problem as segmented least squares.",

author = "Michal Mankowski and Mikhail Moshkov",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.",

year = "2021",

doi = "10.1007/978-3-030-63920-4_13",

language = "English (US)",

series = "Studies in Systems, Decision and Control",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "147--156",

booktitle = "Studies in Systems, Decision and Control",

address = "Germany",

}

TY - CHAP

T1 - Segmented Least Squares

AU - Mankowski, Michal

AU - Moshkov, Mikhail

PY - 2021

Y1 - 2021

N2 - The least squares method is widely used in statistics with common application to regression. The aim is to fit a linear function to set of points that minimizes the sum of the squares of the residuals. In some cases, fitting a linear function with a relatively small error is impossible. Keeping the linear character of approximation, the data points can be split into a sequence of segments, where to each of the segments the line given by a linear function is fitted. The optimization objectives for this problem is to minimize the total least squares error for all segments and to minimize the number of segments used. We refer to such a problem as segmented least squares.

AB - The least squares method is widely used in statistics with common application to regression. The aim is to fit a linear function to set of points that minimizes the sum of the squares of the residuals. In some cases, fitting a linear function with a relatively small error is impossible. Keeping the linear character of approximation, the data points can be split into a sequence of segments, where to each of the segments the line given by a linear function is fitted. The optimization objectives for this problem is to minimize the total least squares error for all segments and to minimize the number of segments used. We refer to such a problem as segmented least squares.

UR - http://www.scopus.com/inward/record.url?scp=85101331921&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-63920-4_13

DO - 10.1007/978-3-030-63920-4_13

M3 - Chapter

AN - SCOPUS:85101331921

T3 - Studies in Systems, Decision and Control

SP - 147

EP - 156

BT - Studies in Systems, Decision and Control

PB - Springer Science and Business Media Deutschland GmbH

ER -

Segmented Least Squares

Abstract

Publication series

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this