Scalable and near-optimal \(\varepsilon\)-tube clusterwise regression
From MaRDI portal
Publication:6080967
DOI10.1007/978-3-031-33271-5_17OpenAlexW4377249777MaRDI QIDQ6080967
Scott Sanner, Elias B. Khalil, Aravinth Chembu
Publication date: 4 October 2023
Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-33271-5_17
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
- \(K\)-plane regression
- A maximum likelihood methodology for clusterwise linear regression
- Algorithm: Clusterwise linear least absolute deviations regression
- A fast algorithm for clusterwise linear regression
- Clusterwise linear regression
- A mathematical programming approach to clusterwise regression model and its extensions
- Clusterwise linear regression modeling with soft scale constraints
- DC programming algorithm for clusterwise linear \(L_1\) regression
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
- Clusterwise support vector linear regression
- Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
- Classification and Regression via Integer Optimization
- Least squares quantization in PCM
- Algorithms for Generalized Clusterwise Linear Regression
This page was built for publication: Scalable and near-optimal \(\varepsilon\)-tube clusterwise regression