摘要:In this paper, we present a least squares version for support vector machines(SVM)classifiers and functionestimation. Due to equality type constraints in the formulation, the solution follows from solving a set of linear equa-tions, instead of quadratic programming for classical SVM. The approach is illustrated on a two-spiral benchmarkclassification problem. The results show that the LS-SVM is an efficient method for solving pattern recognition.
送人玫瑰,手留余香~如您已下载到该资源,可在回帖当中上传与大家共享,欢迎来CDA社区交流学习。(仅供学术交流用。)