Optimal Subsampling for Large Sample Logistic Regression

For massive data, the family of subsampling algorithms is popular to downsize the data volume and reduce computational burden. Existing studies focus on approximating the ordinary least-square estimate in linear regression, where statistical leverage scores are often used to define subsampling proba...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of the American Statistical Association Vol. 113; no. 522; pp. 829 - 844
Main Authors:	Wang, HaiYing, Zhu, Rong, Ma, Ping
Format:	Journal Article
Language:	English
Published:	United States Taylor & Francis 03.04.2018 Taylor & Francis Group,LLC Taylor & Francis Ltd
Subjects:	A-optimality Algorithms Asymptotic properties Computational efficiency Computing costs Computing time Consistency Data data collection equations Logistic regression Massive data Maximum likelihood estimates Minimization Normality Optimal subsampling Optimization Probability Rare event Regression Regression analysis Statistical analysis Statistical methods Statistics Theory and Methods Rare Event Logistic Regression Optimal Subsampling A-optimality Massive Data
ISSN:	0162-1459, 1537-274X, 1537-274X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!