Name
Abstract | ||
|---|---|---|
Disk-based algorithms have the ability to process large-scale data which do not fit into the memory, so they provide good scalability to a mobile device with limited memory resources. In general, the speed of disk I/O is much slower than that of memory access, the total amount of disk I/O is the most crucial factor which determines the efficiency of disk-based algorithms. This paper proposes BlockLDA, an efficient disk-based Latent Dirichlet Allocation (LDA) inference algorithm which can efficiently infer an LDA model when both of the data and model do not fit into the memory. BlockLDA manages the data and model as a set of small blocks so that it can support efficient disk I/O as well as process the LDA inference in a block-wise manner. In addition, it utilizes advanced techniques which help to minimize the amount of disk I/O, including 1) a space reduction algorithm to dynamically manage the block-wise model considering its changing sparsity and 2) a local scheduling algorithm to carefully select the next data blocks so that the number of page faults is minimized. Our experimental results demonstrate that BlockLDA shows better scalability and efficiency than its disk-based and in-memory competitors under the memory-limited environment. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ins.2019.12.058 | Information Sciences |
Keywords | Field | DocType |
Latent Dirichlet Allocation,Parallel algorithm,Disk-based algorithm | Latent Dirichlet allocation,Scheduling (computing),Inference,Mobile device,Page fault,Artificial intelligence,Topic model,Computer engineering,Machine learning,Mathematics,Scalability | Journal |
Volume | ISSN | Citations |
516 | 0020-0255 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Byungju Kim | 1 | 0 | 0.34 |
| Dongha Lee | 2 | 14 | 6.77 |
| Jinoh Oh | 3 | 303 | 15.32 |
| Hwanjo Yu | 4 | 1715 | 114.02 |