.png){kind=icon}
Return
Large Linear Classification When Data Cannot Fit in Memory
.png){kind=icon}
OA
AI
DOI：10.1145/2086737.2086743.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recent advances in linear classification have shown that for applications such as document classification, the training process can be extremely efficient. However, most of the existing training methods are designed by assuming that data can be stored in the computer memory. These methods cannot be easily applied to data larger than the memory capacity due to the random access to the disk. We propose and analyze a block minimization framework for data larger than the memory size. At each step a block of data is loaded from the disk and handled by certain learning methods. We investigate two implementations of the proposed framework for primal and dual SVMs, respectively. Because data cannot fit in memory, many design considerations are very different from those for traditional algorithms. We discuss and compare with existing approaches that are able to handle data larger than memory. Experiments using data sets 20 times larger than the memory demonstrate the effectiveness of the proposed method.
Keywords:
Block minimization methods
large-scale learning
linear classification
support vector machines
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
1.3K
Citations:
4.4K
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveEffect of Chemical Treatments on the Physical Properties of Non-woven Jute/PLA Biocomposites.png)
BioResourcesOAAI
BioResourcesIF0
OAAIShareSaveShareSave
View more