首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种新的粗糙集与支持向量分类机算法
引用本文:邓九英;杜启亮;毛宗源;姚琛.一种新的粗糙集与支持向量分类机算法[J].华南理工大学学报(自然科学版),2008,36(5):123-127.
作者姓名:邓九英;杜启亮;毛宗源;姚琛
作者单位:[1]华南理工大学自动化科学与工程学院,广东广州510640 [2]广东教育学院计算机科学系,广东广州510303
摘    要:用支持向量机的机器学习是依据结构风险最小化原则,序列最小优化(SMO)是较特殊的分解算法。对高维大样本对象,支持向量机训练算法面临耗时增大与维数灾问题,利用粗糙集(RS)对不确定数据处理能力,提出一种新的粗糙集与支持向量分类机算法RS-SMO,可以对数据集做属性约简,生成类边界集作为SMO的训练子集,比原始训练集的维数与规模大小都有一定程度的减少,可构造出具有较好时空性能的算法。用两个实用数据对象做仿真,实验结果表明算法RS-SMO比SMO的性能有大的提高,实现了结构风险最小化。

关 键 词:分解算法  属性约减  边界集  时空性能  
文章编号:1000-565X(2008)05-0123-05
收稿时间:2007-10-22
修稿时间:2007年10月22

A Novel Approach of Support Vector Classifier with Rough Set
Deng Jiu-Ying Qi-Liang Du,Chen Yao.A Novel Approach of Support Vector Classifier with Rough Set[J].Journal of South China University of Technology(Natural Science Edition),2008,36(5):123-127.
Authors:Deng Jiu-Ying Qi-Liang Du  Chen Yao
Abstract:Support Vector Machine obeys Structural Risk Minimization for machine learning. Sequence minimizing optimization (SMO) is an uttermost decomposing algorithm of SVM training. When training the object of high dimensions and large samples, SVM encounters dimension-tragedy and the problem of time-cost increase. As Rough Set has the capability of imprecise data management, a novel approach of Support Vector Classifier with Rough Set (RS-SMO) is presented. The database undergoes attribute-reduct. The boundary sets are formed as training-subset of SMO and are less dimensions and lengths than original training-set. The algorithm analyzing shows good performance of time and space. Two practice objects with huge-data are used to simulate. The experiment results validate RS-SMO outperforming SMO, and implementing Structural Risk Minimization.
Keywords:decomposing algorithm  attribute reduction  boundary set  performances of time and space
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《华南理工大学学报(自然科学版)》浏览原始摘要信息
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号