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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of the American Statistical Association Ročník 113; číslo 522; s. 829 - 844
Hlavní autori:	Wang, HaiYing, Zhu, Rong, Ma, Ping
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States Taylor & Francis 03.04.2018 Taylor & Francis Group,LLC Taylor & Francis Ltd
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!