检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学应用数学系
出 处:《系统工程理论与实践》2008年第7期160-164,共5页Systems Engineering-Theory & Practice
基 金:国家自然科学基金(60574075,60674108)
摘 要:在使用支持向量机(SVM)分类时,存在以下两个问题:一是当存在噪点时,分类的精度低;二是对大规模样本集,训练时所需内存空间较大,运行时间较长.针对以上问题,给出一种基于具有距离性能的核函数的减样方法,称为删减法(DRM).该方法定位定量分析了噪点及多余样本点的一般比例.在应用时,分三步进行:首先根据小概率原理给出一小阈值删除噪点;然后给出一个较大阈值减去同类中心附近的大量多余的样本点;最后以另一个大的比例减去位于距异类中心较远的对分类不起作用的样本点,以便提取具有代表性的边界向量.试验结果检验了该方法的有效性,即,既减少了训练时间,又提高了分类精度.There exist two problems in using support vector machine (SVM) as follows: One is the lower classification accuracy when existing noises. The other is larger memory needed and longer time taken in training. For the above problems, a denosing and sample-reducting method, named deletion-reduction method (DRM) based on the kernel with distance performance, is proposed. The general proportion of the noises and excrescent sample points are analyzed in locality and quantity. The three steps are needed in application: Firstly, one small threshold is given to delete those noisy points lie on the adjacent boundary. Secondly, a large number of redundant sample points are reduced near the center of the same classes based on one large threshold. Finally, the other large proportion is decided to reduce those sample points lie on the further from the different class center so that the representative boundary vectors can be extracted. The results of experiments show the efficiency of the proposed method, i.e. it can reduce training time and can also improve classification accuracy.
分 类 号:TP183[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145