共查询到18条相似文献,搜索用时 968 毫秒
1.
将基于粒子群算法的支持向量机与半监督学习理论相结合,提出了粒子群算法支持向量机的半监督回归模型。针对典型的实验数据集进行实验,并将实验结果与常规的遗传算法支持向量机和粒子群支持向量机模型进行对比。实验结果表明,粒子群算法支持半监督回归模型明显提高了回归估计的精度。 相似文献
2.
近年来,半监督学习在模式识别和机器学习领域引起了广泛关注。在这些方法中,半监督支持向量机是非常主流的一类方法。然而,学习过程中热核函数的参数选择问题一直困扰着研究人员,若选取不当,学习性能会显著下降。为了解决该问题,本文提出一种新颖的基于局部行为搜索策略的半监督学习算法。新算法基于人类行为搜索策略,传统的支持向量机被正则化为拉普拉斯图。在搜索到特征空间的局部分布后,行为因子能够映射到样本邻域的潜在概率分布。为验证新算法有效性,本文分别进行了UCI数据集和实际通信辐射源特征数据集实验。实验结果显示与传统方法相比,新算法的分类结果能够更加有效和稳定。 相似文献
3.
4.
5.
6.
孙艳 《信息技术与信息化》2006,(5):72-73
本文介绍了基于统计学习理论的支持向量机的基本思想。在分析了支持向量机的优点的基础上,对支持向量机算法进行了改进,并应用于邮件过滤。实验证明改进的支持向量机提高了垃圾邮件的过滤性能。 相似文献
7.
提出了一种基于支撑向量机的多类分类器,用N-1个支撑向量机组合构成一个具有二叉树结构形式的N-多类分类器.讨论了该多类分类器的泛化推广能力,同时还提出了该多类分类器的基于特征空间的BTSVM学习算法,BTSVM算法使用核函数转换的方式计算特征空间的样本距离;采用类间最小距离最大化作为聚类准则,在每个决策结点产生两个最优子集;然后采用支撑向量机学习算法学习两个最优子集,确定决策结点的最优分类面.理论和实验结果表明,本文提出的基于支撑向量机的多类分类器在整体性能上要优于其它类似的分类器系统。 相似文献
8.
提出了基于概率测度的支持向量机算法,它采用概率分布作为均值嵌入构造再生希尔伯特空间,为了能够直接采用任何标准的基于核的学习技术,又构造了支持向量机的一般形式,称为基于概率测度的支持向量机(PMSVM).通过在MNIST数据库构建的虚拟样本进行实验,证明了该算法在识别率和时间消耗上更为有效. 相似文献
9.
基于最小二乘支持向量机回归算法,本文在前期工作的基础上进行了扩展,提出了更加详尽的自适应迭代最小二乘支持向量机回归算法. 与标准的LSSVR相比,本文提出的算法在学习新样本的时候利用了已有的学习结果,可以快速获得新的学习机. 模拟结果表明,自适应迭代最小二乘支持向量机回归算法能够自适应地确定支持向量的数目,保留了QP方法在训练SVM时支持向量的稀疏性,在相近的回归精度下,该算法极大地提高了标准LSSVR学习的速度. 相似文献
10.
针对现有车牌识别系统效率低的问题,提出了一种改进的支持向量机算法。首先对车牌进行预处理和定位,将每个特征区域构建一个多核心组合。以半定规划求解最佳的权系数。使用改进的半定规划来解决多核学习算法,降低搜索空间。最后构建车牌识别模型。仿真实验表明,该算法效率高,稳定性好。 相似文献
11.
《中国邮电高校学报(英文版)》2008
To acquire the baselines of key performance indicators (KPI) which are critical for the real-time performance monitoring (RTPM), an improved time series prediction approach is proposed based on support vector machines (SVM). Considering the characteristics of the KPI time series, wavelet multi-resolution is carried before modeling by SVM, and the result is the sum of prediction values of each branch. Experimental results show that the prediction is of high precision. 相似文献
12.
A PAC-Bayesian margin bound for linear classifiers 总被引:3,自引:0,他引:3
Herbrich R. Graepel T. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2002,48(12):3140-3150
We present a bound on the generalization error of linear classifiers in terms of a refined margin quantity on the training sample. The result is obtained in a probably approximately correct (PAC)-Bayesian framework and is based on geometrical arguments in the space of linear classifiers. The new bound constitutes an exponential improvement of the so far tightest margin bound, which was developed in the luckiness framework, and scales logarithmically in the inverse margin. Even in the case of less training examples than input dimensions sufficiently large margins lead to nontrivial bound values and-for maximum margins-to a vanishing complexity term. In contrast to previous results, however, the new bound does depend on the dimensionality of feature space. The analysis shows that the classical margin is too coarse a measure for the essential quantity that controls the generalization error: the fraction of hypothesis space consistent with the training sample. The practical relevance of the result lies in the fact that the well-known support vector machine is optimal with respect to the new bound only if the feature vectors in the training sample are all of the same length. As a consequence, we recommend to use support vector machines (SVMs) on normalized feature vectors only. Numerical simulations support this recommendation and demonstrate that the new error bound can be used for the purpose of model selection. 相似文献
13.
支持向量分类中,高斯核不区分样本中各个特征的重要性,显然各个特征对分类的贡献一般是不相同的.为了体现这种差别从而提高支持向量机的泛化性能,文中提出了多宽度高斯核的概念.多宽度高斯核增加了支持向量机的超级参数,进一步地,文中提出了多参数模型选择算法.算法利用误差界自动实现模型选择.通过实验验证了多宽度高斯核和多参数模型选择算法的有效性. 相似文献
14.
Support vector machine techniques for nonlinear equalization 总被引:7,自引:0,他引:7
The emerging machine learning technique called support vector machines is proposed as a method for performing nonlinear equalization in communication systems. The support vector machine has the advantage that a smaller number of parameters for the model can be identified in a manner that does not require the extent of prior information or heuristic assumptions that some previous techniques require. Furthermore, the optimization method of a support vector machine is quadratic programming, which is a well-studied and understood mathematical programming technique. Support vector machine simulations are carried out on nonlinear problems previously studied by other researchers using neural networks. This allows initial comparison against other techniques to determine the feasibility of using the proposed method for nonlinear detection. Results show that support vector machines perform as well as neural networks on the nonlinear problems investigated. A method is then proposed to introduce decision feedback processing to support vector machines to address the fact that intersymbol interference (ISI) data generates input vectors having temporal correlation, whereas a standard support vector machine assumes independent input vectors. Presenting the problem from the viewpoint of the pattern space illustrates the utility of a bank of support vector machines. This approach yields a nonlinear processing method that is somewhat different than the nonlinear decision feedback method whereby the linear feedback filter of the decision feedback equalizer is replaced by a Volterra filter. A simulation using a linear system shows that the proposed method performs equally to a conventional decision feedback equalizer for this problem 相似文献
15.
关重件是影响装备战备完好性的重要因素,准确的需求预测可以极大地提高装备的保障能力。基于支持向量机预测方法,构建了关重件需求时间序列预测模型,建立了预测需求是否发生和需求量准确度的二维预测结果误差评价机制,预测结果表明支持向量机的需求预测方法精度较高。 相似文献
16.
17.
18.
基于最小二乘支持向量机的飞机备件多元分类 总被引:1,自引:0,他引:1
飞机后续备件配置直接关系到装备的战备完好率和寿命周期费用,对备件的正确分类是进行备件配置决策的前提。支持向量机是采用结构风险最小化原则代替传统统计学中的基于大样本的经验风险最小化原则的新型机器学习方法,具有出色的学习分类能力和推广能力。研究了新型支持向量机算法-最小二乘支持向量机,设计了基于多元分类的最小二乘支持向量机,在此基础上,建立了飞机备件多元分类模型,并对某机型的备件进行了分类。结果表明,基于最小二乘支持向量机的飞机备件多元分类方法是有效、可行的。 相似文献