Abstract
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.
Similar content being viewed by others
References
Preda, C., Saporta, G.: Clusterwise PLS regression on a stochastic process. Comput. Stat. Data Anal. 49, 99–108 (2005)
Wedel, M., Kistemaker, C.: Consumer benefit segmentation using clusterwise linear regression. Int. J. Res. Mark. 6(1), 45–59 (1989)
Späth, H.: Algorithm 39: clusterwise linear regression. Computing 22, 367–373 (1979)
Späth, H.: Algorithm 48: a fast algorithm for clusterwise linear regression. Computing 29, 175–181 (1981)
Gaffney, S., Smyth, P.: Trajectory clustering using mixtures of regression models. In: Chaudhuri, S., Madigan, D. (eds.) Proceedings of the ACM Conference on Knowledge Discovery and Data Mining, pp. 63–72, New York (1999)
Zhang, B.: Regression clustering. In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM03), pp. 451–458. IEEE Computer Society, Washington, DC (2003)
DeSarbo, W.S., Cron, W.L.: A maximum likelihood methodology for clusterwise linear regression. J. Classif. 5(2), 249–282 (1988)
Carbonneau, R.A., Caporossi, G., Hansen, P.: Globally optimal clusterwise regression by mixed logical-quadratic programming. Eur. J. Oper. Res. 212, 213–222 (2011)
Carbonneau, R.A., Caporrossi, G., Hansen, P.: Extensions to the repetitive branch-and-bound algorithm for globally-optimal clusterwise regression. Comput. Oper. Res. 39(11), 2748–2762 (2012)
DeSarbo, W.S., Oliver, R.L., Rangaswamy, A.: A simulated annealing methodology for clusterwise linear regression. Psychometrika 54(4), 707–736 (1989)
Bagirov, A.M., Ugon, J., Mirzayeva, H.: Nonsmooth nonconvex optimization approach to clusterwise linear regression problems. Eur. J. Oper. Res. 229(1), 132–142 (2013)
Xavier, A.E., Oliveira, A.A.F.D.: Optimal covering of plane domains by circles via hyperbolic smoothing. J. Glob. Optim. 31(3), 493–504 (2005)
Xavier, A.E.: The hyperbolic smoothing clustering method. Pattern Recogn. 43, 731–737 (2010)
Bagirov, A.M., Al Nuiamat, A., Sultanova, N.: Hyperbolic smoothing function method for minimax problems. Optimization 62(6), 759–782 (2013)
Bache, K., Lichman, M.: UCI machine learning repository. School of Information and Computer Science, University of California, Irvine, CA (2013). http://archive.ics.uci.edu/ml
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bagirov, A.M., Ugon, J. & Mirzayeva, H.G. An algorithm for clusterwise linear regression based on smoothing techniques. Optim Lett 9, 375–390 (2015). https://doi.org/10.1007/s11590-014-0749-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-014-0749-3