Online Learning Algorithms for Double-Weighted Least Squares Twin Bounded Support Vector Machines

详细信息    查看全文

• 作者：Juntao Li ; Yimin Cao ; Yadi Wang ; Huimin Xiao
• 关键词：Support vector machine ; Twin bounded support vector machine ; Double ; weighted mechanism ; Online learning algorithms ; Pruning mechanism
• 刊名：Neural Processing Letters
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：45
• 期：1
• 页码：319-339
• 全文大小：
• 刊物类别：Physics and Astronomy
• 刊物主题：Artificial Intelligence (incl. Robotics); Complex Systems; Computational Intelligence;
• 出版者：Springer US
• ISSN：1573-773X
• 卷排序：45

文摘

Twin support vector machine with two nonparallel classifying hyperplanes and its extensions have attracted much attention in machine learning and data mining. However, the prediction accuracy may be highly influenced when noise is involved. In particular, for the least squares case, the intractable computational burden may be incurred for large scale data. To address the above problems, we propose the double-weighted least squares twin bounded support vector machines and develop the online learning algorithms. By introducing the double-weighted mechanism, the linear and nonlinear double-weighted learning models are proposed to reduce the influence of noise. The online learning algorithms for solving the two models are developed, which can avoid computing the inverse of the large scale matrices. Furthermore, a new pruning mechanism which can avoid updating the kernel matrices in every iteration step for solving nonlinear model is also developed. Simulation results on three UCI data with noise demonstrate that the online learning algorithm for the linear double-weighted learning model can get least computation time as well considerable classification accuracy. Simulation results on UCI data and two-moons data with noise demonstrate that the nonlinear double-weighted learning model can be effectively solved by the online learning algorithm with the pruning mechanism.