共查询到18条相似文献,搜索用时 484 毫秒
1.
2.
3.
一种基于GA和支持向量机的车牌字符识别方法 总被引:2,自引:2,他引:0
以高斯核为其核函数的支持向量机在实际应用中表现出优良的学习性能,被广泛应用于模式分类中。支持向量机的识别性能对参数的选取是敏感的,惩罚因子C和核函数参数σ对支持向量机性能会产生重要的影响。针对高斯核支持向量机在车牌字符识别问题中的应用,提出了一种基于遗传算法的参数选择方法。首先确定合适的遗传算法适应度函数,然后利用遗传算法对支持向量机的参数进行优化,最后在各个识别子网中分别采用参数优化后的支持向量机对车牌字符进行识别。实验结果表明,该方法取得了令人满意的识别率。 相似文献
4.
基于高斯核的支持向量机应用很广泛,高斯核参数σ的选择对分类器性能影响很大,本文提出了从核函数性质和几何距离角度来选择参数σ,并且利用高斯函数的麦克劳林展开解决了参数σ的优化选择问题。实验结果表明,该方法能较快地确定核函数参数σ,且 SVM 分类效果较好,解决了高斯核参数σ在实际应用中不易确定的问题。 相似文献
5.
6.
7.
针对支持向量机中混合核函数参数的选取还没有一套完整的理论支撑,提出基于蚁群算法和循环交叉验证法的参数优选方法。以平均加权误差作为不同参数下支持向量机预测效果的评价指标,采用循环交叉验证法计算平均加权误差。采用蚁群算法来提高混合核函数参数优化效率,减少计算工作量。通过在某型飞机机体研制费用预测中的应用,显示基于最优参数下混合核函数的支持向量机的预测误差最小,表明该参数优选方法能够提高预测精度。 相似文献
8.
9.
基于改进萤火虫算法的SVM核参数选取 总被引:1,自引:0,他引:1
支持向量机(SVM)是一种性能优异的机器学习算法,其核函数参数的选取对于建模精度以及泛化能力有着重要的影响。提出一种基于改进萤火虫算法的SVM核函数参数选取方法,通过改进萤火虫位置更新公式并在移动过程中引入亮度特征从而确定最佳的SVM核函数参数。实验表明,该算法选取的SVM核函数参数在保证分类器收敛性能的同时,提高了分类精度,取得了良好的优化效果。 相似文献
10.
11.
The classification problem by the nonlinear support vector machine (SVM) with kernel function is discussed in this paper. Firstly, the stretching ratio is defined to analyze the performance of the kernel function, and a new type of kernel function is introduced by modifying the Gaussian kernel. The new kernel function has many properties as good as or better than Gaussian kernel: such as its stretching ratio is always lager than 1, and its implicit kernel map magnifies the distance between the vectors in local but without enlarging the radius of the circumscribed hypersphere that includes the whole mapping vectors in feature space, which maybe gets a bigger margin. Secondly, two aspects are considered to choose a good spread parameter for a given kernel function approximately and easily. One is the distance criterion which minimizes the sum-square distance between the labeled training sample and its own center and maximizes the sum-square distance between the training sample and the other labeled-center, which is equivalent to the famous Fisher ratio. The other is the angle criterion which minimizes the angle between the kernel matrix and the target matrix. Then a better criterion is given by combined those aspects. Finally, some experiments show that our methods are efficient. 相似文献
12.
标准的SVM分类计算过程中有大量的支持向量参与了计算,导致了分类速度缓慢。该文为提高SVM的分类速度,提出了一种快速的多项式核函数SVM分类算法,即将使用多项式核的SVM分类决策函数展开为关于待分类向量各分量的多项式,分类时通过计算各个多项式的值而得到分类结果,使分类计算量和支持向量数量无关,又保留了全部支持向量的信息。当多项式核函数的阶数或待分类向量的维数较低而支持向量数量较多时,使用该算法可以使SVM 分类的速度得到极大的提高。针对实际数据集的实验表明了该算法的有效性。 相似文献
13.
14.
15.
This work is about intra-sentence segmentation performed before syntactic analysis of long sentences composed of at least 20 words in an English–Korean machine translation system. A long sentence has been known to spend enormous computational time and space when it is analyzed syntactically. It can also produce poor translation results. To resolve this problem, we partitioned a long sentence into a few segments to analyze each segment separately. To partition the sentence, firstly, we tried to find candidates for each segment position in the sentence. We then generated input vectors representing lexical contexts of the corresponding candidates and also used the support vector machines (SVM) algorithm to learn and recognize the appropriate segment positions. We used three kernel functions, the linear kernel, the polynomial kernel and the Gaussian kernel, to find optimal hyperplanes classifying proper positions and we compared results obtained from each kernel function. As a result of the experiments, we acquired 0.81, 0.83, and 0.79 f-measure values from the linear, polynomial and Gaussian kernel, respectively. 相似文献
16.
Chengfu Yang Zhang Yi 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2008,12(7):677-683
A method of document clustering based on locality preserving indexing (LPI) and support vector machines (SVM) is presented.
The document space is generally of high dimensionality, and clustering in such a high-dimensional space is often infeasible
due to the curse of dimensionality. In this paper, by using LPI, the documents are projected into a lower-dimension semantic
space in which the documents related to the same semantic are close to each other. Then, by using SVM, the vectors in semantic
space are mapped by means of a Gaussian kernel to a high-dimensional feature space in which the minimal enclosing sphere is
searched. The sphere, when mapped back to semantics space, can separate into several independent components by the support
vectors, each enclosing a separate cluster of documents. By combining the LPI and SVM, not only higher clustering accuracies
in a more unsupervised effective way, but also better generalization properties can be obtained. Extensive demonstrations
are performed on the Reuters-21578 and TDT2 data sets.
This work was supported by National Science Foundation of China under Grant 60471055, Specialized Research Fund for the Doctoral
Program of Higher Education under Grant 20040614017. 相似文献
17.
18.
质子交换膜燃料电池(PEMFC)是一个非线性、多输入、强耦合、大时延的复杂动态系统,传统的根据系统物理和化学的特性建立的数学模型,具有较大的局限性.从质子交换膜燃料电池的物理结构、输出特性曲线和数学模型方面对其进行了描述,针对PEMFC的复杂动态环境,利用支持向量机对于给定试验样本数据的良好的泛化性能,根据在自制的PEMFC单电池上进行试验所得到的数据,对质子交换膜燃料电池的电特性进行了回归运算.结果发现,在样本数目较小时,采用指数型径向基核函数对PEMFC进行回归运算较为理想;当数据样本数目巨大时,高斯径向基核函数可以获得很好的支持向量稀疏度,具有明显的优越性,这为PEMFC燃料电池的建模仿真及有效控制其电压输出特性提供了新的思路. 相似文献