A fast algorithm for clusterwise linear regression

DOI10.1007/BF02249940zbMath0485.65030OpenAlexW2312680915MaRDI QIDQ1164376

Helmuth Späth

Publication date: 1982

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02249940

zbMATH Keywords

least squaresfast algorithmcluster analysisclusterwise linear regressionminimum variance criterion

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear regression; mixed models (62J05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Probabilistic methods, stochastic differential equations (65C99)

Related Items (31)

A procedure for estimating the number of clusters in logistic regression clustering ⋮ Algorithm: Clusterwise linear least absolute deviations regression ⋮ Partition of interval-valued observations using regression ⋮ Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization ⋮ A fast algorithm for clusterwise linear absolute deviations regression ⋮ A general estimation procedure based on group means ⋮ On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications ⋮ A fuzzy approach to robust regression clustering ⋮ Scalable and near-optimal \(\varepsilon\)-tube clusterwise regression ⋮ Functional fuzzy clusterwise regression analysis ⋮ Multivariate linear regression for heterogeneous data ⋮ Incremental DC optimization algorithm for large-scale clusterwise linear regression ⋮ An \(M\)-estimation-based procedure for determining the number of regression models in regression clustering ⋮ Regularized fuzzy clusterwise ridge regression ⋮ A robust linear grouping algorithm ⋮ Robust Linear Clustering ⋮ \(K\)-plane regression ⋮ Linear grouping using orthogonal regression ⋮ A three-way clusterwise multidimensional unfolding procedure for the spatial representation of context dependent preferences ⋮ Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression ⋮ A weighted least-squares approach to clusterwise regression ⋮ An algorithm for clusterwise linear regression based on smoothing techniques ⋮ On the multisource hyperplanes location problem to fitting set of points ⋮ A maximum likelihood methodology for clusterwise linear regression ⋮ Clusterwise p^* models for social network analysis ⋮ The next‐generation K‐means algorithm ⋮ A consistent procedure for determining the number of clusters in regression clustering ⋮ Nonsmooth optimization algorithm for solving clusterwise linear regression problems ⋮ A mathematical programming approach to clusterwise regression model and its extensions ⋮ Nonsmooth nonconvex optimization approach to clusterwise linear regression problems ⋮ Unnamed Item

Uses Software

• AS 75
• Algorithm 39

Cites Work

• Unnamed Item
• Correction to: Algorithm 39. Clusterwise linear regression
• Clusterwise linear regression
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• Numerically Stable Methods for Updating Regressions
• Least Squares Computations by Givens Transformations Without Square Roots

This page was built for publication: A fast algorithm for clusterwise linear regression