计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (22): 89-92.
• 学术探讨 • 上一篇 下一篇
曾绍华1,2
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
ZENG Shao-hua1,2
Received:
Revised:
Online:
Published:
Contact:
摘要: 根据LS-SVM不具稀疏解的特性,提出了LS-SVM的组合优化算法及其改进算法,并利用整数规划优化了LS-SVM的组合优化算法中划分的样本子集包含的样本个数p。最后,对算法复杂性做了分析,仿真验证了算法的收敛性和有效性。
关键词: LS-SVM, 组合优化算法, 整数规划
Abstract: According as the nature that LS-SVM hasn’t the sparse solution,LS-SVM combination optimization algorithm and its improving is proposed.And the p is optimized with integer programming,which is number of samples in the samples subset based on LS-SVM combination optimization algorithm.Finally,analyzes it’s complexity,and tests and verifies convergence and availability of the algorithms by the simulation.
Key words: LS-SVM, combination optimization algorithm, integer programming
曾绍华1,2. LS-SVM的组合优化算法研究 [J]. 计算机工程与应用, 2007, 43(22): 89-92.
ZENG Shao-hua1,2. Research on LS-SVM combination optimization algorithm[J]. Computer Engineering and Applications, 2007, 43(22): 89-92.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2007/V43/I22/89