Parallel algorithm of local support vector regression for large datasets

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose the new parallel algorithm of local support vector regression (local SVR), called kSVR for effectively dealing with large datasets. The learning strategy of kSVR performs the regression task with two main steps. The first one is to partition the training data into k clusters, followed which the second one is to learn the SVR model from each cluster to predict the data locally in the parallel way on multi-core computers. The kSVR algorithm is faster than the standard SVR for the non-linear regression of large datasets while maintaining the high correctness in the prediction. The numerical test results on datasets from UCI repository showed that our proposed kSVR is efficient compared to the standard SVR.

Cite

CITATION STYLE

APA

Bui, L. D., Tran-Nguyen, M. T., Kim, Y. G., & Do, T. N. (2017). Parallel algorithm of local support vector regression for large datasets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10646 LNCS, pp. 139–153). Springer Verlag. https://doi.org/10.1007/978-3-319-70004-5_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free