An Online Robust Support Vector Regression for Data Streams

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

Abstract

Since support vector regression (SVR) is a flexible regression algorithm, its computational complexity does not depend on the dimensionality of the input space, and it has excellent generalization capability. However, a central assumption with SVRs is that all the required data is available at the time of construction, which means these algorithms cannot be used with data streams. Incremental SVR has been offered as a potential solution, but its accuracy suffers with noise and learning speeds are slow. To overcome these two limitations, we propose a novel incremental regression algorithm, called online robust support vector regression (ORSVR). ORSVR solves nonparallel bound functions simultaneously. Hence, the large quadratic programming problem (QPP) in classical v-SVR are decomposed into two smaller QPPs. An incremental learning algorithm then solves each QPP step-by-step. The results of a series of comparative experiments demonstrate that the ORSVR algorithm efficiently solves regression problems in data streams, with or without noise, and speeds up the learning process.

Cite

CITATION STYLE

APA

Yu, H., Lu, J., & Zhang, G. (2022). An Online Robust Support Vector Regression for Data Streams. IEEE Transactions on Knowledge and Data Engineering, 34(1), 150–163. https://doi.org/10.1109/TKDE.2020.2979967

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