论文信息 - L2-SVM Training with Distributed Data

L2-SVM Training with Distributed Data

We propose an algorithm for the problem of training a SVM model when the set of training examples is horizontally distributed across several data sources. The algorithm requires only one pass through each remote source of training examples, and its accuracy and efficiency follow a clear pattern as function of a user-defined parameter. We outline an agent-based implementation of the algorithm.

[1] Bernhard Schölkopf,et al. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond , 2005, IEEE Transactions on Neural Networks.

[2] Tamir Hazan,et al. A Parallel Decomposition Solver for SVM: Distributed dual ascend using Fenchel Duality , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[3] Stefan Rüping,et al. Incremental Learning with Support Vector Machines , 2001, ICDM.

[4] Ivor W. Tsang,et al. Core Vector Machines: Fast SVM Training on Very Large Data Sets , 2005, J. Mach. Learn. Res..

[5] Huan Liu,et al. Handling concept drifts in incremental learning with support vector machines , 1999, KDD '99.

[6] Vasant Honavar,et al. Learning classifiers from distributed, semantically heterogeneous, autonomous data sources , 2004 .

[7] Kenneth L. Clarkson,et al. Optimal core-sets for balls , 2008, Comput. Geom..

[8] Alex Smola,et al. Kernel methods in machine learning , 2007, math/0701907.