An algorithm for clusterwise linear regression based on smoothing techniques
Version 2 2024-06-04, 13:50Version 2 2024-06-04, 13:50
Version 1 2018-08-24, 14:45Version 1 2018-08-24, 14:45
journal contribution
posted on 2024-06-04, 13:50 authored by AM Bagirov, Julien UgonJulien Ugon, HG Mirzayeva© 2014, Springer-Verlag Berlin Heidelberg. We propose an algorithm based on an incremental approach and smoothing techniques to solve clusterwise linear regression (CLR) problems. This algorithm incrementally divides the whole data set into groups which can be easily approximated by one linear regression function. A special procedure is introduced to generate an initial solution for solving global optimization problems at each iteration of the incremental algorithm. Such an approach allows one to find global or approximate global solutions to the CLR problems. The algorithm is tested using several data sets for regression analysis and compared with the multistart and incremental Späth algorithms.
History
Journal
Optimization lettersVolume
9Pagination
375-390Location
New York, N.Y.ISSN
1862-4472eISSN
1862-4480Language
engPublication classification
C1.1 Refereed article in a scholarly journalCopyright notice
2014, Springer-VerlagIssue
2Publisher
SpringerUsage metrics
Categories
Keywords
Licence
Exports
RefWorksRefWorks
BibTeXBibTeX
Ref. managerRef. manager
EndnoteEndnote
DataCiteDataCite
NLMNLM
DCDC