An algorithm for clusterwise linear regression based on smoothing techniques
type: Item
instance of: scholarly article
title: An algorithm for clusterwise linear regression based on smoothing techniques
zbMATH Open document ID: 1311.90106
author: Julien Ugon
author: Hijran G. Mirzayeva
author: A. M. Bagirov
published in: Optimization Letters
publication date: 2015-03-23T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6418517
zbMATH Keywords: clusterwise regression
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: smoothing techniques
zbMATH Keywords: nonconvex optimization
describes a project that uses: UCI-ml
describes a project that uses: Algorithm 39
MaRDI profile type: Publication
full work available at URL: s11590-014-0749-3
OpenAlex ID: W1966363216
cites work: Clusterwise PLS regression on a stochastic process
cites work: Clusterwise linear regression
cites work: A fast algorithm for clusterwise linear regression
cites work: Optimal covering of plane domains by circles via hyperbolic smoothing
cites work: Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
cites work: A maximum likelihood methodology for clusterwise linear regression
cites work: Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
cites work: The hyperbolic smoothing clustering method
cites work: Hyperbolic smoothing function method for minimax problems
DOI: 10.1007/S11590-014-0749-3
description: scientific article; zbMATH DE number 6418517