Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
From MaRDI portal
Publication:2355817
DOI10.1016/j.ejor.2013.02.059zbMath1317.90242OpenAlexW2052531332MaRDI QIDQ2355817
Julien Ugon, Hijran G. Mirzayeva, Adil M. Bagirov
Publication date: 28 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.02.059
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear regression; mixed models (62J05) Nonconvex programming, global optimization (90C26)
Related Items (16)
Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency ⋮ Clusterwise linear regression modeling with soft scale constraints ⋮ Clusterwise support vector linear regression ⋮ Scalable and near-optimal \(\varepsilon\)-tube clusterwise regression ⋮ DC programming algorithm for clusterwise linear \(L_1\) regression ⋮ Incremental DC optimization algorithm for large-scale clusterwise linear regression ⋮ Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms ⋮ Scale-constrained approaches for maximum likelihood estimation and model selection of clusterwise linear regression models ⋮ Kernel-based online regression with canal loss ⋮ \(K\)-plane regression ⋮ Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations ⋮ Incremental method for multiple line detection problem -- iterative reweighted approach ⋮ An algorithm for clusterwise linear regression based on smoothing techniques ⋮ A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem ⋮ A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem ⋮ Nonsmooth optimization algorithm for solving clusterwise linear regression problems
Uses Software
Cites Work
- Unnamed Item
- A procedure for estimating the number of clusters in logistic regression clustering
- A maximum likelihood methodology for clusterwise linear regression
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- Clusterwise PLS regression on a stochastic process
- Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods
- A fast algorithm for clusterwise linear regression
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
- Clusterwise linear regression
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- A mathematical programming approach to clusterwise regression model and its extensions
- A combined approach for segment-specific market basket analysis
- Robust clusterwise linear regression through trimming
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- A consistent procedure for determining the number of clusters in regression clustering
This page was built for publication: Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
