Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
From MaRDI portal
Recommendations
- Nonsmooth optimization algorithm for solving clusterwise linear regression problems
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
- An algorithm for clusterwise linear regression based on smoothing techniques
- DC programming algorithm for clusterwise linear \(L_1\) regression
- Incremental DC optimization algorithm for large-scale clusterwise linear regression
Cites work
- A combined approach for segment-specific market basket analysis
- A consistent procedure for determining the number of clusters in regression clustering
- A fast algorithm for clusterwise linear regression
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
- A mathematical programming approach to clusterwise regression model and its extensions
- A maximum likelihood methodology for clusterwise linear regression
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- A procedure for estimating the number of clusters in logistic regression clustering
- Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods
- Clusterwise linear regression
- Clusterwise PLS regression on a stochastic process
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- Robust clusterwise linear regression through trimming
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
Cited in
(20)- Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency
- Clusterwise linear regression modeling with soft scale constraints
- DC programming algorithm for clusterwise linear \(L_1\) regression
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Scale-constrained approaches for maximum likelihood estimation and model selection of clusterwise linear regression models
- 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
- Clusterwise support vector linear regression
- Incremental DC optimization algorithm for large-scale clusterwise linear regression
- Kernel-based online regression with canal loss
- Nonsmooth optimization algorithm for solving clusterwise linear regression problems
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
- scientific article; zbMATH DE number 4205655 (Why is no real title available?)
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
- \(K\)-plane regression
- Scalable and near-optimal \(\varepsilon\)-tube clusterwise regression
- Performance characterization of clusterwise linear regression algorithms
- Out-of-sample estimation for a branch-and-bound algorithm with growing datasets
This page was built for publication: Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355817)
