作者: Jiancheng Sun , Xiaohe Li , Yong Yang , Jianguo Luo , Yaohui Bai
DOI: 10.1016/J.INS.2011.08.028
关键词: Tree kernel 、 Radial basis function kernel 、 String kernel 、 Kernel embedding of distributions 、 Artificial intelligence 、 Polynomial kernel 、 Kernel (statistics) 、 Kernel principal component analysis 、 Variable kernel density estimation 、 Pattern recognition 、 Mathematics
摘要: The performance of a kernel method often depends mainly on the appropriate choice function. In this study, we present data-dependent for scaling function so as to optimize classification methods. Instead finding support vectors in feature space, first find region around separating boundary input and subsequently scale correspondingly. It is worth noting that proposed does not require training step enable specified algorithm can be applied various Experimental results using both artificial real-world data are provided demonstrate robustness validity method.