.png){kind=icon}
.png){kind=icon}
Return
Multi-innovation Newton recursive methods for solving the support vector machine regression problems
.png){kind=icon}
PRE
AI
DOI：10.1002/rnc.5672.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The support vector machine has been widely used in binary classification applications because of the simplicity of its implementation. This article proposes an online identification method based on the support vector machine in the field of parameter identification. By substituting the constraint item into the original criterion function to form a new criterion function about the weight vector and the bias item, and then on the basis of the recursive identification methods, the newly established criterion function is minimized by using the Newton search to derive the Newton recursive support vector machine algorithm. Additionally, in order to improve the performance of the Newton recursive support vector machine algorithm, the multi-innovation identification theory is applied to optimize the algorithm, and a multi-innovation Newton recursive support vector machine algorithm is derived. In addition, the convergence and the calculation amount of the proposed algorithms are carefully analyzed in this article. Finally, a numerical simulation example is given to compare the Newton recursive algorithm and the corresponding multi-innovation recursive algorithm. The results show that the algorithms and optimization strategy studied in this article are effective.
Keywords:
multi-innovation identification theory
Newton search
recursive identification
support vector machine
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.2
Papers:
6.9K
Citations:
1.4W