https://scholars.lib.ntu.edu.tw/handle/123456789/118603
標題: | Formulations of support vector machines: a note from an optimization point of view | 作者: | Lin, Chih-Jen | 公開日期: | 2001 | 卷: | 13 | 期: | 2 | 起(迄)頁: | 307-317 | 來源出版物: | Neural Computation | 摘要: | In this article, we discuss issues about formulations of support vector machines (SVM) from an optimization point of view. First, SVMs map training data into a higher-(maybe infinite-) dimensional space. Currently primal and dual formulations of SVM are derived in the finite dimensional space and readily extend to the infinite-dimensional space. We rigorously discuss the primal-dual relation in the infinite-dimensional spaces. Second, SVM formulations contain penalty terms, which are different from unconstrained penalty functions in optimization. Traditionally unconstrained penalty functions approximate a constrained problem as the penalty parameter increases. We are interested in similar properties for SVM formulations. For two of the most popular SVM formulations, we show that one enjoys properties of exact penalty functions, but the other is only like traditional penalty functions, which converge when the penalty parameter goes to infinity. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/155216 https://www.scopus.com/inward/record.uri?eid=2-s2.0-0000222692&doi=10.1162%2f089976601300014547&partnerID=40&md5=19cd75e94bc445a144651c0b7aeabb6c |
ISSN: | 08997667 |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。