Low-degree Polynomial Mapping of Data for SVM
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 97 === Non-linear mapping functions have long been used in SVM to transform data into a higher dimensional space, allowing the classifier to separate non-linearly distributed data instances. Kernel tricks are used to avoid the problem of a huge number of features of th...
Main Authors: | Yin-Wen Chang, 張瀠文 |
---|---|
Other Authors: | Chih-Jen Lin |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/85416613440796675619 |
Similar Items
-
Low-degree Polynomial Mapping of NLP Data andFeatures Condensing by Hashing
by: Po-Han Chung, et al.
Published: (2011) -
Polynomial Mappings with Small Degree
by: Jelonek Zbigniew
Published: (2015-06-01) -
Polynomials and degrees of maps in real normed algebras
by: Sakkalis Takis
Published: (2020-06-01) -
On the Low-Degree Solution of the Sylvester Matrix Polynomial Equation
by: Yunbo Tian, et al.
Published: (2021-01-01) -
Distinct Distance Estimates and Low Degree Polynomial Partitioning
by: Guth, Lawrence
Published: (2016)