Information-based optimal subdata selection for clusterwise linear regression

DOI10.5705/SS.202023.0302MaRDI QIDQ7229415zbMATH OpenFDO

Authors Yanxi Liu, John Stufken, Min Yang

Publication date 15 April 2026

Published in Statistica Sinica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5705/SS.202023.0302

zbMATH Keywords

D-optimalityinformation matrixlatent indicatormassive dataMLE

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• A maximum likelihood methodology for clusterwise linear regression
• A review on design inspired subsampling for big data
• A Subsampling Method for Regression Problems Based on Minimum Energy Criterion
• Algorithms for Generalized Clusterwise Linear Regression
• Clusterwise linear regression
• Clusterwise linear regression modeling with soft scale constraints
• Determining the number of components in mixtures of linear models.
• Handbook of big data
• scientific article; zbMATH DE number 193528 (Why is no real title available?)
• Identifiability of models for clusterwise linear regression
• Information-Based Optimal Subdata Selection for Big Data Linear Regression
• Information-based optimal subdata selection for big data logistic regression
• Maximum likelihood estimates of the parameters of a mixture of two regression lines
• Methods of Estimation for Markets in Disequilibrium: A Further Study
• On the convergence properties of the EM algorithm
• Optimum Designs in Regression Problems
• Orthogonal subsampling for big data linear regression
• Predictive Subdata Selection for Computer Models
• Statistical guarantees for the EM algorithm: from population to sample-based analysis
• Supervised Stratified Subsampling for Predictive Analytics
• The Elements of Statistical Learning

This page was built for publication: Information-based optimal subdata selection for clusterwise linear regression

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