期刊文献+

Training SVMs on a bound vectors set based on Fisher projection 被引量:1

Training SVMs on a bound vectors set based on Fisher projection
原文传递
导出
摘要 Standard support vector machines (SVMs) train- ing algorithms have O(l3) computational and O(l2) space complexities, where l is the training set size. It is thus com- /putationally infeasible on very large data sets.To alleviate the Computational burden in SVM training, we propose an algo- rithm to train SVMs on a bound vectors set that is extracted based on Fisher projection. For linear separate problems, we use linear Fisher discriminant to compute the projection line, while for non-linear separate problems, we use kernel Fisher discriminant to compute the projection line. For each case, we select a certain ratio samples whose projections are adja- cent to those of the other class as bound vectors. Theoretical analysis shows that the proposed algorithm is with low com- putational and space complexities.Extensive experiments on several classification benchmarks demonstrate the effective- ness of our approach. Standard support vector machines (SVMs) train- ing algorithms have O(l3) computational and O(l2) space complexities, where l is the training set size. It is thus com- /putationally infeasible on very large data sets.To alleviate the Computational burden in SVM training, we propose an algo- rithm to train SVMs on a bound vectors set that is extracted based on Fisher projection. For linear separate problems, we use linear Fisher discriminant to compute the projection line, while for non-linear separate problems, we use kernel Fisher discriminant to compute the projection line. For each case, we select a certain ratio samples whose projections are adja- cent to those of the other class as bound vectors. Theoretical analysis shows that the proposed algorithm is with low com- putational and space complexities.Extensive experiments on several classification benchmarks demonstrate the effective- ness of our approach.
出处 《Frontiers of Computer Science》 SCIE EI CSCD 2014年第5期793-806,共14页 中国计算机科学前沿(英文版)
基金 This work was sponsored by the National Natural Sci- ence Foundation of China (Grant Nos. 61370083, 61073043, 61073041 and 61370086), the National Research Foundation for the Doctoral Program of Higher Education of China (20112304110011 and 20122304110012), the Natural Science Foundation of Heilongjiang Province (F200901), and the Harbin Outstanding Academic Leader Foundation of Heilongjiang Province of China (2011RFXXG015).
关键词 support vector machines bound vectors set Fisher discriminant sequential minimal optimization support vector machines, bound vectors set,Fisher discriminant, sequential minimal optimization
  • 相关文献

参考文献2

二级参考文献8

  • 1张铃,张钹,吴福朝.神经网络的规划学习算法[J].计算机学报,1994,17(9):669-675. 被引量:13
  • 2Drucker H,IEEE Trans Neural Networks,1999年,10卷,5期,1048页
  • 3Zhang Ling,IEEE Trans Neural Networks,1999年,10卷,4期,925页
  • 4Amari S,Neural Networks,1999年,12卷,783页
  • 5Zhang L,IEEE Trans Neural Networks,1995年,6期,3页
  • 6Pardalos P M,Linear Algebra Appl,1991年,152卷,1期,69页
  • 7Schlkopf B,IEEE Transactions on Signal Processing,1997年,45卷,11期
  • 8阎平凡.对多层前向神经网络研究的进一步看法[J].电子学报,1999,27(5):82-85. 被引量:25

共引文献84

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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