Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization

DOI10.1007/S00357-014-9155-XzbMATH Open1360.62318OpenAlexW2076491140MaRDI QIDQ288987FDOQ288987

Gilles Caporossi, Pierre Hansen, Réal A. Carbonneau

Publication date: 27 May 2016

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-014-9155-x

Recommendations

• Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
• scientific article
• Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
• Nonsmooth optimization algorithm for solving clusterwise linear regression problems
• An algorithm for clusterwise linear regression based on smoothing techniques

zbMATH Keywords

heuristicscombinatorial optimizationglobal optimizationbranch and boundcolumn generationclusterwise regressionsequencing

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites Work

• Identifiability of models for clusterwise linear regression
• Title not available (Why is that?)
• A mixture likelihood approach for generalized linear models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Selected Topics in Column Generation
• A fast algorithm for clusterwise linear regression
• Clusterwise linear regression
• Branch-and-price: Column generation for solving huge integer programs
• A maximum likelihood methodology for clusterwise linear regression
• Correction to: Algorithm 39. Clusterwise linear regression
• A mathematical programming approach to clusterwise regression model and its extensions
• Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
• Mixed logical-linear programming
• A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
• Logic, optimization, and constraint programming
• Decomposition Principle for Linear Programs
• Title not available (Why is that?)
• A bio-mimetic approach to marketing segmentation: Principles and comparative analysis
• A dyadic segmentation approach to business partnerships
• Least Squares Computations by Givens Transformations Without Square Roots
• Locally Linear Regression and the Calibration Problem for Micro-Array Analysis
• Column Generation
• Title not available (Why is that?)
• A new column generation algorithm for logical analysis of data
• An improved column generation algorithm for minimum sum-of-squares clustering
• Integrated methods for optimization.

Cited In (4)

• On the multisource hyperplanes location problem to fitting set of points
• Incremental DC optimization algorithm for large-scale clusterwise linear regression
• Scalable and near-optimal \(\varepsilon\)-tube clusterwise regression
• A clusterwise nonlinear regression algorithm for interval-valued data

Uses Software

• lp_solve
• CPLEX
• Algorithm 39

This page was built for publication: Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288987)