SVM的数学原理详解

最新推荐文章于 2024-06-11 14:36:19 发布

A_Carman

最新推荐文章于 2024-06-11 14:36:19 发布

阅读量1.1k

点赞数 4

文章标签： SVM数学原理拉格朗日乘子法对偶理论凸优化

本文链接：https://blog.csdn.net/wjw1993year/article/details/81166198

版权

这里写图片描述

参考文献

[1] 周志华. (2016). 机器学习 : = Machine learning. 清华大学出版社.
[2] Platt, J. C. (1998). Sequential Minimal Optimization: A Fast Algorithm for Training Support Vector Machines. Advances in Kernel Methods-support Vector Learning (Vol.208, pp.págs. 212-223).
[3] Wikipedia contributors. (2018, July 15). Support vector machine. In Wikipedia, The Free Encyclopedia. Retrieved 09:29, July 22, 2018, from https://en.wikipedia.org/w/index.php?title=Support_vector_machine&oldid=850382510
[4] Lin, H. T., Lin, C. J., & Weng, R. C. (2007). A note on platt’s probabilistic outputs for support vector machines. Machine Learning, 68(3), 267-276.
[5] ALEX J. SMOLA and BERNHARD SCHOLKOPF (2003). A tutorial on support vector regression. Statistics and Computing 14: 199–222, 2004
[6] u013421941的博客 (2017). 凸优化与对偶问题
https://blog.csdn.net/u013421941/article/details/54635095
[7] Boyd, S., & Vandenberghe, L. (2004). Convex Optimization. Cambridge University Press.
[8] Wikipedia contributors. (2018, May 20). Min-max theorem. In Wikipedia, The Free Encyclopedia. Retrieved 09:43, July 22, 2018, from https://en.wikipedia.org/w/index.php?title=Min-max_theorem&oldid=842096368