.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Block minimization methods
large-scale learning
linear classification
support vector machines
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.8
论文数:
1.3K
被引数:
4.4K
机构
引用论文
分享收藏Effect of Chemical Treatments on the Physical Properties of Non-woven Jute/PLA Biocomposites化学处理对非织造黄麻/PLA生物复合材料物理性能的影响.png)
BioResourcesOAAI
BioResourcesIF0
OAAI分享收藏
查看更多内容