Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 229, Issue 1, Pages 132-142Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2013.02.059
Keywords
Clusterwise linear regression; Incremental algorithm; Spath algorithm
Ask authors/readers for more resources
Clusterwise regression consists of finding a number of regression functions each approximating a subset of the data. In this paper, a new approach for solving the clusterwise linear regression problems is proposed based on a nonsmooth nonconvex formulation. We present an algorithm for minimizing this nonsmooth nonconvex function. 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 a good starting point for solving global optimization problems at each iteration of the incremental algorithm. Such an approach allows one to find global or near global solution to the problem when the data sets are sufficiently dense. The algorithm is compared with the multistart Spath algorithm on several publicly available data sets for regression analysis. (C) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available