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

DOI10.1007/S00357-014-9155-XMaRDI QIDQ288987zbMATH OpenOpenAlexFDO

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

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

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)

Recommendations

• Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
• scientific article; zbMATH DE number 4205655
• 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

Cites work

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

Cited in

(5)

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

Describes a project that uses

Uses Software

• Algorithm 39
• CPLEX
• lp_solve

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)