|
Double Chunking for Solving SVMs for Very Large Datasets AbstractIn this paper we present a novel approach to solve the SVM for very large training sets. We propose to substitute the shrinking technique for a double chunk, so we are able to exploit the cache memory more efficiently and obtain the solution in considerably less runtime complexity.
[Edit] |