Deakin University
Browse

An algorithm for clusterwise linear regression based on smoothing techniques

Version 2 2024-06-04, 13:50
Version 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 letters

Volume

9

Pagination

375-390

Location

New York, N.Y.

ISSN

1862-4472

eISSN

1862-4480

Language

eng

Publication classification

C1.1 Refereed article in a scholarly journal

Copyright notice

2014, Springer-Verlag

Issue

2

Publisher

Springer

Usage metrics

    Research Publications

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC