Version 2 2019-12-01, 23:13Version 2 2019-12-01, 23:13
Version 1 2019-09-16, 12:33Version 1 2019-09-16, 12:33
conference contribution
posted on 2019-12-01, 23:13authored byDaisuke Murakami, Narumasa Tsutsumida, Takahiro Yoshida, Tomoki Nakaya, Binbin Lu
This study develops a scalable GWR (ScaGWR) for large samples. Unlike existing GWR algorithms, the ScaGWR achieves a linear time estimation through pre-compression of large matrices and vectors before the leave-one-out cross validation (LOOCV), which is the heaviest part in the standard GWR. Our proposed algorithm enables us to estimate a regularized GWR from one million samples even without parallelization. The R code is available in the R package scgwr. Besides, for faster computation, the code is embedded into C++ code and implemented in the GWmodel package.