Large linear classification when data cannot fit in memory
- 25 July 2010
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 833-842
- https://doi.org/10.1145/1835804.1835910
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- P-packSVM: Parallel Primal grAdient desCent Kernel SVMPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- A dual coordinate descent method for large-scale linear SVMPublished by Association for Computing Machinery (ACM) ,2008
- PegasosPublished by Association for Computing Machinery (ACM) ,2007
- Training linear SVMs in linear timePublished by Association for Computing Machinery (ACM) ,2006
- Classifying large data sets using SVMs with hierarchical clustersPublished by Association for Computing Machinery (ACM) ,2003
- On the convergence of the coordinate descent method for convex differentiable minimizationJournal of Optimization Theory and Applications, 1992