期刊文献+

密度惩罚支持向量数据描述

Density-Punished Support Vector Data Description
下载PDF
导出
摘要 基于相对密度概念,文中提出一种密度惩罚的支持向量数据描述方法.该方法把相对密度和对样本的误分惩罚关联起来.如果样本的相对密度较大,则其是目标样本的可能性较大,因此需加大其误分的惩罚力度.同理相对密度小的样本,有可能是位于边界上的点或噪声点,相应的误分惩罚应减小.在UCI数据集上的实验结果表明,文中方法比标准支持向量数据描述及密度诱导的支持向量数据描述都有更好的描述性能. Based on the concept of relative density degrees, a density-punished support vector data description method is presented. The relative density degrees are associated with punishing misclassifications. If the relative density degree of the sample is large, it is likely to be a target sample. Thus, a large penalty should be put on its misclassification. Similarly, if the relative density degree of the sample is small, it might be a boundary or noise point so that the corresponding penalty for its misclassification should be small as well. The experimental results on UCI datasets show that the proposed method has better performance compared with support vector data description and density-induced support vector data description.
出处 《模式识别与人工智能》 EI CSCD 北大核心 2014年第2期160-165,共6页 Pattern Recognition and Artificial Intelligence
基金 国家自然科学基金项目(No.61373093 61033013) 江苏省自然科学基金项目(No.BK2011284 BK201222725) 江苏省高校自然科学基金项目(No.13KJA520001) 江苏省青蓝工程项目资助
关键词 支持向量数据描述 相对密度 核方法 Support Vector Data Description Relative Density Degree Kernel Method
  • 相关文献

参考文献5

  • 1David M.J. Tax,Robert P.W. Duin.Support Vector Data Description[J].Machine Learning.2004(1)
  • 2KiYoung Lee,Dae-Won Kim,Doheon Lee,Kwang H. Lee.Improving support vector data description using local density degree[J].Pattern Recognition.2005(10)
  • 3Markos Markou,Sameer Singh.Novelty detection: a review—part 1: statistical approaches[J].Signal Processing.2003(12)
  • 4Christopher J.C. Burges.A Tutorial on Support Vector Machines for Pattern Recognition[J].Data Mining and Knowledge Discovery.1998(2)
  • 5David M.J Tax,Robert P.W Duin.Support vector domain description[J].Pattern Recognition Letters.1999(11)

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部