We explore a technique to learn Support Vector Models (SVMs) when training data is partitioned among several data sources. The basic idea is to efficiently compute SVMs which can be reduced to Minimal Enclosing Ball (MEB) problems in a feature space by finding a coreset for the image of the data in that space. Our main result is that the union of local core-sets provides a close approximation to a global core-set from which the SVM can be recovered. The method requires hence a single pass through each source of data in order to compute local core-sets and then to recover the SVM from their union. Extensive simulations on real datasets are presented in order to evaluate accuracy and efficiency, comparing to a widely used single-pass heuristic to learn standard SVMs.
|Number of pages||8|
|Publication status||Published - 1 Jan 2010|
|Event||conference - |
Duration: 1 Jan 2010 → …
|Period||1/01/10 → …|
Lodi, S., Ñanculef, R., & Sartori, C. (2010). SEBD 2010 - Proceedings of the 18th Italian Symposium on Advanced Database Systems. 150-157. Paper presented at conference, . https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84890927486&origin=inward