Skip to main navigation Skip to search Skip to main content

Subdata selection algorithm for linear model discrimination

  • Jun Yu
  • , Hai Ying Wang*
  • *Corresponding author for this work
  • University of Connecticut

Research output: Contribution to journalArticlepeer-review

Abstract

A statistical method is likely to be sub-optimal if the assumed model does not reflect the structure of the data at hand. For this reason, it is important to perform model selection before statistical analysis. However, selecting an appropriate model from a large candidate pool is usually computationally infeasible when faced with a massive data set, and little work has been done to study data selection for model selection. In this work, we propose a subdata selection method based on leverage scores which enables us to conduct the selection task on a small subdata set. Compared with existing subsampling methods, our method not only improves the probability of selecting the best model but also enhances the estimation efficiency. We justify this both theoretically and numerically. Several examples are presented to illustrate the proposed method.

Original languageEnglish
Pages (from-to)1883-1906
Number of pages24
JournalStatistical Papers
Volume63
Issue number6
DOIs
Publication statusPublished - Dec 2022

Keywords

  • Bayesian information criterion
  • Big data
  • D-optimal design
  • Discrimination design
  • Entropy
  • Measurement constraints

Fingerprint

Dive into the research topics of 'Subdata selection algorithm for linear model discrimination'. Together they form a unique fingerprint.

Cite this