A selective review on statistical methods for massive data computation: distributed computing, subsampling, and minibatch techniques /
Xuetong Li; Yuan Gao; Hong Chang [and others].
- 1 online resource (1 article).
The source lists 14 contributors; the first 12 names are recorded as access points. The complete source author list is retained in the catalogue manifest. Publication type: Journal article. Linked open-access copy: published version.
Open access; no subscription required for the linked open-access version.
This paper presents a selective review of statistical computation methods for massive data analysis. A huge amount of statistical methods for massive data computation have been rapidly developed in the past decades. In this work, we focus on three categories of statistical computation methods: (1) distributed computing, (2) subsampling methods, and (3) minibatch gradient techniques. The first class of literature is about distributed computing and focuses on the situation, where the dataset size is too huge to be comfortably handled by one single computer. In this case, a distributed computation system with multiple computers has to be utilized. The second class of literature is about subsampling methods and concerns about the situation, where the blacksample size of dataset is small enough to be placed on one single computer but too large to be easily processed by its memory as a whole. The last class of literature studies those minibatch gradient related optimization techniques, which have been extensively used for optimizing various deep learning models.
Creative Commons Attribution (licence family recorded by the source; version not supplied in metadata).
In English.
10.1080/24754269.2024.2343151 doi
massive data analysis distributed computing subsampling statistical computing deep learning optimization big data
B. Sc. Computer Science UMUN open access collection distributed computing