A Split-and-Conquer Approach for Analysis of Extraordinarily Large Data
By Xueying Chen, Min‐ge Xie. 2014
309 citations recorded by the source corpus.
Subfields: Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/aa65ded6dccdf9612a19e89775df8d83959e51f3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Statistics and Probability
- Qiang Liu
- Jason D. Lee
- Jonathan E. Taylor
- Yuekai Sun
- Nathalie Villa-Vialaneix
- Christine Tuleau-Malot
- Jean‐Michel Poggi
- Robin Genuer
Citations in the corpus
- Random Forests for Big Data (2015, methodology): “One variant relies on subsampling while three others are related to parallel implementations of random forests and involve either various adaptations of bootstrap to Big Data or “divide-and-conquer” approaches.”
- Communication-efficient sparse regression: a one-shot approach (2015, background): “Chen and Xie (2012) and Wang, Peng and Dunson (2014) also consider sparse linear regression in the distributed setting. They propose an averaging estimator that obtains the same convergence rate as the centralized lasso (lasso on all the data), but relies heavily on the irrepresentable condition and”