| 最小二乘支持向量机分类的稀疏化方法研究 |
| |
| 引用本文： | 陈圣磊,陈耿,薛晖.最小二乘支持向量机分类的稀疏化方法研究[J].计算机工程,2011,37(22):145-147. |
| |
| 作者姓名： | 陈圣磊 陈耿 薛晖 |
| |
| 作者单位： | 1. 南京审计学院信息科学学院,南京,211815
2. 东南大学计算机科学与工程学院,南京,210096 |
| |
| 基金项目： | 国家自然科学基金资助项目，江苏省高校自然科学重大基础研究基金资助项目，扛苏省六大人才高峰基金资助项目，江苏高校"青蓝工程"基金，江苏政府留学奖学金基金 |
| |
| 摘 要： | 最小二乘支持向量机在提高求解效率的同时，会丧失解的稀疏性，导致其在预测新样本时速度较慢。为此，提出一种稀疏化最小二乘支持向量机分类算法。在特征空间中寻找近似线性无关向量组，构造分类判别函数的稀疏表示，相应的最小二乘支持向量机优化问题可以通过线性方程组求解，从而得到最优判别函数。实验结果表明，该算法在不损失分类精度的前提下，能够获得比最小二乘支持向量机更快的预测速度。
|
| 关 键 词： | 支持向量机 最小二乘 稀疏化 分类 特征空间 二次规划 |
| 收稿时间： | 2011-08-12 |
Research on Sparsification Approach for Least Squares Support Vector Machine Classification |
| |
| CHEN Sheng-lei,CHEN Geng,XUE Hui.Research on Sparsification Approach for Least Squares Support Vector Machine Classification[J].Computer Engineering,2011,37(22):145-147. |
| |
| Authors: | CHEN Sheng-lei CHEN Geng XUE Hui |
| |
| Affiliation: | 1.School of Information Science,Nanjing Audit University,Nanjing 211815,China;2.School of Computer Science and Engineering,Southeast University,Nanjing 210096,China) |
| |
| Abstract: | Least Squares Support Vector Machine（LSSVM） increases the algorithm＇s efficiency,but the sparsity of the solution is lost,which results in the low prediction speed of new samples.A new sparsified LSSVM classification algorithm is proposed.The approximate linear independent vector set in feature space is first searched and thus the sparse discriminative function can be constructed.The corresponding optimization problem of LSSVM can then be solved through the linear equation set.So the optimal discriminative function is achieved.Experiments show that the prediction speed of the proposed algorithm is faster than that of LSSVM without the loss of classification accuracy. |
| |
| Keywords: | Support Vector Machine（SVM） least squares sparsification classification feature space quadratic programming |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
