Pages that link to "Item:Q2017840"
From MaRDI portal
The following pages link to An algorithm for clusterwise linear regression based on smoothing techniques (Q2017840):
Displaying 12 items.
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization (Q288987) (← links)
- A fast algorithm for clusterwise linear absolute deviations regression (Q1093356) (← links)
- DC programming algorithm for clusterwise linear \(L_1\) regression (Q1706682) (← links)
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression (Q1761225) (← links)
- A clusterwise nonlinear regression algorithm for interval-valued data (Q2124194) (← links)
- Clusterwise support vector linear regression (Q2189912) (← links)
- Incremental DC optimization algorithm for large-scale clusterwise linear regression (Q2226259) (← links)
- Nonsmooth optimization algorithm for solving clusterwise linear regression problems (Q2342128) (← links)
- Nonsmooth nonconvex optimization approach to clusterwise linear regression problems (Q2355817) (← links)
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms (Q4638918) (← links)
- On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications (Q5084663) (← links)
- Algorithms for Generalized Clusterwise Linear Regression (Q5364278) (← links)