人工蜂群算法优化支持向量机及其在音乐流派自动分类中的应用

音乐流派是区分和描述不同音乐的一种标签,借助数学和计算机的方法将大量音乐自动分为不同流派是目前国内外研究的热点问题之一.支持向量机(SVM)由于其具有严格的数学理论基础而被广泛应用于音乐流派自动分类.然而,支持向量机的惩罚参数和核参数对其分类效果具有重要影响.以交叉验证正确率作为适应值,采用人工蜂群(ABC)算法优化支持向量的控制参数.在音乐流派自动分类的仿真实验中,经ABC算法优化后的支持向量机取得的平均预测正确率为80.8000%(最优预测正确率达83%),高出默认参数SVM 18.8个百分点.与粒子群优化算法及遗传算法相比,仿真实验结果同样显示了ABC算法的优越性.     

带优化参数的SVR模型及在软件成本估算中的应用

随着社会各行各业对软件开发投资的日益增长,产业界和学术界越来越关注可靠的软件成本估算,以有效控制软件开发过程中相关风险.为了能更准确地估算软件成本,提出一种带遗传算法优化参数的支持向量回归机模型,用遗传算法来优化支持向量回归机模型中的参数集(C,γ,ε),可以避免参数选择的盲目性,能显著提高支持向量回归机模型的预测能力.分别用IBM DP、Kemerer和Hallmark三个数据库来验证模型的有效性,并与常用的线性回归模型进行对比,结果显示采用遗传算法优化的支持向量回归机模型具有很好的学习精度和推广能力,在MMRE和Pred(0.25)两个标准上都优于线性回归模型.     

基于多分类支持向量机的评估模型研究

支持向量机中的参数直接影响其推广能力,针对参数选取的主观性,提出基于改进的遗传算法优化其参数,并将其应用于银行个人信用的五等级分类问题中,针对多分类问题,设计了3个二值分类器,不同分类的参数不同,通过实验证实可以达到更精细的分类效果.     

基于Fuzzy理论的数据挖掘算法研究(Ⅰ)

“数据挖掘”是数据处理的一个新领域.支持向量机是数据挖掘的一种新方法,该技术在很多领域得到了成功的应用.但是,支持向量机目前还存在许多局限,当支持向量机的训练集中含有模糊信息时,支持向量机将无能为力.为解决一般情况下支持向量机中含有模糊信息(模糊参数)问题,研究了模糊机会约束规划、模糊分类中的模糊特征及其表示方法,建立了模糊支持向量分类机理论,给出了模糊线性可分的模糊支持向量分类机算法.     

基于Fuzzy理论的数据挖掘算法研究Ⅱ

"数据挖掘"是数据处理的一个新领域.支持向量机是数据挖掘的一种新方法,该技术在很多领域得到了成功的应用.但是,支持向量机目前还存在许多局限,当支持向量机的训练集中含有模糊信息时,支持向量机将无能为力.为解决一般情况下支持向量机中含有模糊信息(模糊参数)问题,研究了模糊机会约束规划、模糊分类中的模糊特征及其表示方法,建立了模糊支持向量分类机理论,给出了模糊线性可分的模糊支持向量分类机算法.     

基于邻域粗糙集属性约简的对偶约束式LS-SVM财务困境预测模型研究

为了提高财务困境预测的正确率,改善模型预测的效果,将邻域粗糙集和遗传算法应用于对偶约束式最小二乘支持向量机,提出了一种基于邻域粗糙集属性约简的对偶约束式最小二乘支持向量机预测模型.同时,给出了这一改进模型的实现步骤.实证结果表明,通过邻域粗糙集指标预处理和遗传算法参数优化后,不但提高了模型预测的正确率,还降低了模型运行的时间,证实了该模型应用于财务困境预测是有效的.     

优化支持向量机在降水预报中的应用

利用粒子群优化算法对支持向量机参数进行优化,主成分分析法对众多的降水因子进行特征提取,将取得的主成分作为优化支持向量机的特征向量建立优化支持向量机降水预测模型,并对广西降水进行预测.仿真结果表明,粒子群优化支持向量机的预测结果与降水实际值有很好的一致性,通过与其他模型进行比较,表明了模型拟合和泛化能力方面的优越性.     

一种新的光滑支持向量机的构造及其应用

光滑支持向量机模型是一个无约束、可微的最优化模型,人们可应用快速的最优化方法求解,从而降低计算复杂性.在前人工作的基础上研究基于样条函数的光滑支持向量机,采用广义三弯矩方法构造出六次样条光滑函数,分析了其性能及与正号函数的逼近精度,实现了求解六次样条光滑支持向量机的算法,与其它光滑支持向量机进行了比较,取得了较好的结果.最后将其应用于心脏病模型诊断,实验结果显示具有较高的精确度.     

一种求解分类问题的新算法

本文提出了基于支持向量回归机(SVR)的一种新分类算法.它和标准的支持向量机(SVM)不同:标准的支持向量机(SVM)采用固定的模度量间隔且最优化问题与参数有关.本文中我们可以用任意模度量间隔,得到的最优化问题是无参数的线性规划问题,避免了参数选择.数值试验表明了该算法的有效性.     

基于主成分分析和PSO-SVM的树叶分类方法研究

提出一种树叶分类方法.在数据方面,所获得数据既包含树叶的图形信息数据,也包含树叶的纹理信息.在前期数据预处理阶段,采用主成分分析方法对原始数据进行降维处理,从16个特征中提取出3个主成分,且累计主成分贡献率达到85%以上.在后期数据分析处理阶段,用支持向量机对树叶数据进行分类预测,并用粒子群算法对支持向量机参数进行寻优处理,提高分类精度.实验结果表明,相对于遗传算法和网格搜索法寻到的最优参数相比,粒子群算法优化支持向量机具有最高的准确率,高达94.1%,高于其他两种分类方法.     

Support vector machine classifiers with uncertain knowledge sets via robust optimization

In this article we study support vector machine (SVM) classifiers in the face of uncertain knowledge sets and show how data uncertainty in knowledge sets can be treated in SVM classification by employing robust optimization. We present knowledge-based SVM classifiers with uncertain knowledge sets using convex quadratic optimization duality. We show that the knowledge-based SVM, where prior knowledge is in the form of uncertain linear constraints, results in an uncertain convex optimization problem with a set containment constraint. Using a new extension of Farkas' lemma, we reformulate the robust counterpart of the uncertain convex optimization problem in the case of interval uncertainty as a convex quadratic optimization problem. We then reformulate the resulting convex optimization problems as a simple quadratic optimization problem with non-negativity constraints using the Lagrange duality. We obtain the solution of the converted problem by a fixed point iterative algorithm and establish the convergence of the algorithm. We finally present some preliminary results of our computational experiments of the method.     

A kernel-free quadratic surface support vector machine for semi-supervised learning

In this paper, we propose a kernel-free semi-supervised quadratic surface support vector machine model for binary classification. The model is formulated as a mixed-integer programming problem, which is equivalent to a non-convex optimization problem with absolute-value constraints. Using the relaxation techniques, we derive a semi-definite programming problem for semi-supervised learning. By solving this problem, the proposed model is tested on some artificial and public benchmark data sets. Preliminary computational results indicate that the proposed method outperforms some existing well-known methods for solving semi-supervised support vector machine with a Gaussian kernel in terms of classification accuracy.     

Path planning for robots under stochastic uncertainty *

In order to reduce large online measurement and correction expenses, the a priori informations on the random variations of the model parameters of a robot and its working environment are taken into account already at the planning stage. Thus, instead of solving a deterministic path planning problem with a fixed nominal parameter vector, here, the optimal velocity profile along a given trajectory in work space is determined by using a stochastic optimization approach. Especially, the standard polygon of constrained motion-depending on the nominal parameter vector-is replaced by a more general set of admissible motion determined by chance constraints or more general risk constraints. Robust values (with respect to stochastic parameter variations) of the maximum, minimum velocity, acceleration, deceleration, resp., can be obtained then by solving a univariate stochastic optimization problem Considering the fields of extremal trajectories, the minimum-time path planning problem under stochastic uncertainty can be solved now by standard optimal deterministic path planning methods     

A nonlinear interval number programming method for uncertain optimization problems

In this paper, a method is suggested to solve the nonlinear interval number programming problem with uncertain coefficients both in nonlinear objective function and nonlinear constraints. Based on an order relation of interval number, the uncertain objective function is transformed into two deterministic objective functions, in which the robustness of design is considered. Through a modified possibility degree, the uncertain inequality and equality constraints are changed to deterministic inequality constraints. The two objective functions are converted into a single-objective problem through the linear combination method, and the deterministic inequality constraints are treated with the penalty function method. The intergeneration projection genetic algorithm is employed to solve the finally obtained deterministic and non-constraint optimization problem. Two numerical examples are investigated to demonstrate the effectiveness of the present method.     

基于改进的PSO-SVM的音频信号特征识别和分类

针对音频信号准确性分类的问题,提出一种基于改进的的粒子群优化算法(PSO)的支持向量机(SVM)音频信号分类的方法,简称IPSO-SVM.首先用Mel倒谱系数法对4种音频信号进行特征提取.其次在PSO中引入自适应变异因子,能够成功地跳出局部极小值点;然后对PSO中的惯性权重进行了改进,将惯性权重由常数变为指数型递减函数.随着迭代的进行,使权重逐渐减小,这样做有利于粒子进行局部寻优.最后用改进的PSO不断优化SVM中的惩罚因子c和核函数参数g来提高预测精度.实验结果表明,与传统的SVM、PSO-SVM、GA-SVM相比,我们提出的IPSO-SVM算法分类结果更精确.     

A Rigorous Global Optimization Algorithm for Problems with Ordinary Differential Equations

The optimization of systems which are described by ordinary differential equations (ODEs) is often complicated by the presence of nonconvexities. A deterministic spatial branch and bound global optimization algorithm is presented in this paper for systems with ODEs in the constraints. Upper bounds for the global optimum are produced using the sequential approach for the solution of the dynamic optimization problem. The required convex relaxation of the algebraic functions is carried out using well-known global optimization techniques. A convex relaxation of the time dependent information is obtained using the concept of differential inequalities in order to construct bounds on the space of solutions of parameter dependent ODEs as well as on their second-order sensitivities. This information is then incorporated in the convex lower bounding NLP problem. The global optimization algorithm is illustrated by applying it to four case studies. These include parameter estimation problems and simple optimal control problems. The application of different underestimation schemes and branching strategies is discussed.     

基于PCA和改进的PSO-SVM的机器人移动方向分类

随着人们创新水平的不断提高,为了更加准确的实现机器人的导航任务,提出了一种基于改进的粒子群优化支持向量机中的参数的方法.首先利用主成分分析法对数据进行降维,然后利用改进的粒子群优化算法,对SVM中的惩罚参数c和核函数的参数g进行优化,最后代入到SVM中,以此来达到运用SVM对机器人的导航任务进行分类识别.相对于其他算法,容易发现改进的粒子群优化算法优化后的支持向量机可以达到很好的效果.这种识别分类可以帮助人们很好的对机器人进行导航,对今后机器人的研究具有很大的应用价值.     

A memetic-based fuzzy support vector machine model and its application to license plate recognition

In this paper, a novel fuzzy support vector machine (FSVM) coupled with a memetic particle swarm optimization (MPSO) algorithm is introduced. Its application to a license plate recognition problem is studied comprehensively. The proposed recognition model comprises linear FSVM classifiers which are used to locate a two-character window of the license plate. A new MPSO algorithm which consists of three layers i.e. a global optimization layer, a component optimization layer, and a local optimization layer is constructed. During the construction process, MPSO performs FSVM parameters tuning, feature selection, and training instance selection simultaneously. A total of 220 real Malaysian car plate images are used for evaluation. The experimental results indicate the effectiveness of the proposed model for undertaking license plate recognition problems.