计算机应用与软件2017，Vol.34Issue(4)：178-182,192,6.DOI:10.3969/j.issn.1000-386x.2017.04.030
基于最佳一致光滑逼近的孪生支持向量机研究
RESEARCH ON TWIN SUPPORT VECTOR MACHINES BASED ON BEST UNIFORM SMOOTHING APPROXIMATION
摘要
Abstract
The essence of twin support vector machines(TWSVM) is to optimise two quadratic programming problems.As the positive constrained variable of objective function was not differentiable, this paper presented a constructing method of polynomial smoothing function based on best uniform approximation.Bernstein and Chebyshev polynomial were established to effectively achieve the best uniform smoothing approximation of the positive function.The best uniform approximation of Chebyshev polynomial is emphasized.The best uniform Chebyshev polynomial was established by applying the Remez algorithm, and each order of the Chebyshev polynomial approximation was discussed.Finally, the objective optimal function based on best uniform approximation polynomial and the degree of sample adaption could be got, and the fast Newton-Armijo algorithm was used for solving the objective optimal function.On the basis of UCI data, we validated the advantages of the method.关键词
孪生支持向量机/最佳一致逼近/适应度Key words
Twin support vector machines/Best uniform approximation/Degree of adaption分类
信息技术与安全科学引用本文复制引用
唐辉军,白玲,杨志民..基于最佳一致光滑逼近的孪生支持向量机研究[J].计算机应用与软件,2017,34(4):178-182,192,6.基金项目
国家自然科学基金项目(10926198) （10926198）
浙江省公益技术应用研究计划项目(2016C33G2620016) （2016C33G2620016）
宁波市自然科学基金项目(2015A610135). （2015A610135）
