A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Clusterwise support vector linear regression
Tekijät: Joki Kaisa, Bagirov Adil M., Karmitsa Napsu, Mäkelä Marko M., Taheri Sona
Kustantaja: ELSEVIER
Julkaisuvuosi: 2020
Journal: European Journal of Operational Research
Tietokannassa oleva lehden nimi: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Lehden akronyymi: EUR J OPER RES
Vuosikerta: 287
Numero: 1
Aloitussivu: 19
Lopetussivu: 35
Sivujen määrä: 17
ISSN: 0377-2217
eISSN: 1872-6860
DOI: https://doi.org/10.1016/j.ejor.2020.04.032
Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/detail/Publication/48732055
In clusterwise linear regression (CLR), the aim is to simultaneously partition data into a given number of clusters and to find regression coefficients for each cluster. In this paper, we propose a novel approach to model and solve the CLR problem. The main idea is to utilize the support vector machine (SVM) approach to model the CLR problem by using the SVM for regression to approximate each cluster. This new formulation of the CLR problem is represented as an unconstrained nonsmooth optimization problem, where we minimize a difference of two convex (DC) functions. To solve this problem, a method based on the combination of the incremental algorithm and the double bundle method for DC optimization is designed. Numerical experiments are performed to validate the reliability of the new formulation for CLR and the efficiency of the proposed method. The results show that the SVM approach is suitable for solving CLR problems, especially, when there are outliers in data.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
