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

DOI10.1007/s00357-014-9155-xzbMath1360.62318OpenAlexW2076491140MaRDI QIDQ288987

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

zbMATH Keywords

global optimizationheuristicscolumn generationcombinatorial optimizationbranch and boundsequencingclusterwise regression

Mathematics Subject Classification ID

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

Related Items (4)

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

Uses Software

• lp_solve
• CPLEX
• Algorithm 39

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A maximum likelihood methodology for clusterwise linear regression
• 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.
• Correction to: Algorithm 39. Clusterwise linear regression
• A fast algorithm for clusterwise linear regression
• Clusterwise linear regression
• Identifiability of models for 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
• A mixture likelihood approach for generalized linear models
• Mixed logical-linear programming
• A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Logic, Optimization, and Constraint Programming
• Decomposition Principle for Linear Programs
• 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
• Selected Topics in Column Generation

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