检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]装甲兵工程学院机械工程系,北京市丰台区100072
出 处:《中国电机工程学报》2008年第32期89-95,共7页Proceedings of the CSEE
基 金:总装备部维改项目
摘 要:直推式支持向量机(support vector machine,SVM)是基于已知样本建立对特定的未知样本进行有效识别的理论框架,与归纳式支持向量机相比,前者更经济、分类效果更佳。然而,直推式支持向量机的致命缺点是需要占用大量的训练时间,为此,提出了基于增量学习的支推式支持向量机训练算法,即把当前迭代训练得到的支持向量样本与新赋予类别标签的部分测试样本作为训练样本集参与下一次的迭代训目的是通过减少训练样本的数量以节约训练时间。同时,为确保算法的收敛性及分类准确率,在训练过程中引入了成对标注及错误回溯处理。实际的状态判别结果证明了该方法的有效性。Transductive support vector machine (SVM) is to construct theoretical frame for recognizing specifically unlabelling sample based on labelling sample effectively. Compared to traditional inductive SVM, transductive SVM is more economical, and has more perfect classification ability. However, fatal shortcoming of transdnctive SVM consumes a great deal of training time.Therefore,training algorithm was proposed for transductive SVM based on incremental learning: That was,the set of sample for next interative training was made of two part: sample of support vector got from currently interative training and some testing sample enduced with label newly.The aim was to reduce training sample and save training time.At the same time, the method of pair labelling and back searching operation according to mistakenly classified testing sample were applied in the course of training to guarantee that the traning algorithm was convergent and had high precision of classification. Practical result of state judgement proves, the method is valid.
关 键 词:直推式支持向量机 状态判别 旋转机械 增量学习 惩罚系数
分 类 号:TH17[机械工程—机械制造及自动化] TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117