一种过程支持向量机及其在动态模式分类中的应用

针对一般SVM在机制上难以直接对动态模式进行分类的问题,提出了一种基于函数正交基展开的过程支持向量机.该模型的输入为时变函数,输出为模式类别.在输入函数空间中选择一组适当的正交函数基,将输入函数在该组函数基下进行有限项展开,把展开式系数作为核函数的输入.由于时变函数在基函数映射下与展开式系数一一对应,从而可利用SVM的变换机制实现动态模式分类.给出了基于SMO的求解算法,实验结果验证了模型和算法的有效性.     

基于粒子群的CDMA功率和速率联合控制算法

提出了基于效用函数的CDMA网络下行链路的功率和速率联合控制最优化算法.在这类算法中,效用函数为非凸函数,经典的最优化理论很难解决这类问题.将粒子群优化方法应用于算法的非凸性设计,并通过仿真算例证明了该算法能有效解决非凸优化问题,且可保证系统的公平性.     

初始聚类中心优化选取的核C-均值聚类算法

在通常的核C-均值聚类算法中,聚类结果对初始聚类中心敏感,随机选取初始聚类中心时,会使得迭代次数较多、分类结果不稳定.针对该问题提出一种优化选取仞始聚类中心的算法.该方法采用一种改进的最大最小距离算法对原始空间中的数据进行粗分类,将粗分类结果中每类类心作为初始聚类中心,再运用核C-均值聚类算法进行分类.仿真实验结果表明方法能有效减少迭代次数,使分类结果更加稳定,分类识别率也有一定程度的提高.     

隐核最小二乘分类器在故障诊断中的应用

作为一种基于正定核的学习方法,传统支持向量机(Support Vector Machine,SVM)能较好地解决小样本、非线性、过学习、维数灾和局部极小等问题,从而广泛应用于模式识别、回归估计等领域。当前,核方法及其在故障诊断中的应用引起了人们的广泛重视并成为研究热点。为解决传统支持向量对核函数正定性的限制及求解速度不高的缺陷,通过引入最小二乘支持向量机分类算法提高学习速度,采用隐核特征映射技术实现核函数的进一步扩展,提出了一种新的隐核最小二乘分类器(HKLSC)算法。将其应用于实际工业过程的故障诊断中并根据采集的滚动轴承数据进行了仿真。结果表明,该隐核分类器具有很好的故障诊断性能,为故障诊断提供了一种新的有效途径。     

信息检索中的广义作用效应链应用研究

广义作用句和广义效应句的划分是作用效应链思想在句类体系中的体现.这一划分是对自然语言语句的一个最基本的分类.如果结合信息检索中采取的统计学办法,在检索结果的基础上进行二次精筛选,则提供给查询用户的结果必将更符合实际需求,能更有效提高信息检索的正确率.从人为数据统计结果来看,这一思路有效地把统计方·法和基本规则方法结合起来,提高了信息检索的检索准确率.     

一种改进的基于时空混沌系统的Hash函数构造方法

首先介绍了一种以时空混沌为基础的构造Hash函数的典型方案,并分析了它的不足和安全性问题.在此基础上提出了一种改进的Hash函数构造方法.理论和仿真实验分析表明,该算法具有更好的统计特性和更高的效率,有效地弥补了原算法中存在的碰撞漏洞.     

一种新颖隶属度函数的模糊支持向量机

传统的支持向量机(SVM)训练含有外部点或噪音数据时,容易产生过拟合(over-fitting)。通过模糊隶属度函数来降低外部点或被污染数据的选择。本文提出了一种新的核隶属度函数,这种新的隶属度函数不仅依赖于每个样本点到类型中心的距离,还依赖于该样本点最邻近的K个其他样本点的距离。实验结果表明了具有该隶属度函数的模糊支持向量机的有效性。     

Pi演算对图灵机的表达

为了研究Pi演算的表达能力,我们试着用它来表达图灵机。研究结果表明,只要对Pi演算进行一定的的扩展,即引入某些函数符号,允许对发送的名字作一定的运算,就可以用Pi演算的规约来表达图灵机的运算过程。     

Hierarchical classification of protein function with ensembles of rules and particle swarm optimisation

This paper focuses on hierarchical classification problems where the classes to be predicted are organized in the form of a tree. The standard top-down divide and conquer approach for hierarchical classification consists of building a hierarchy of classifiers where a classifier is built for each internal (non-leaf) node in the class tree. Each classifier discriminates only between its child classes. After the tree of classifiers is built, the system uses them to classify test examples one class level at a time, so that when the example is assigned a class at a given level, only the child classes need to be considered at the next level. This approach has the drawback that, if a test example is misclassified at a certain class level, it will be misclassified at deeper levels too. In this paper we propose hierarchical classification methods to mitigate this drawback. More precisely, we propose a method called hierarchical ensemble of hierarchical rule sets (HEHRS), where different ensembles are built at different levels in the class tree and each ensemble consists of different rule sets built from training examples at different levels of the class tree. We also use a particle swarm optimisation (PSO) algorithm to optimise the rule weights used by HEHRS to combine the predictions of different rules into a class to be assigned to a given test example. In addition, we propose a variant of a method to mitigate the aforementioned drawback of top-down classification. These three types of methods are compared against the standard top-down hierarchical classification method in six challenging bioinformatics datasets, involving the prediction of protein function. Overall HEHRS with the rule weights optimised by the PSO algorithm obtains the best predictive accuracy out of the four types of hierarchical classification method.     

A new adaptive backstepping Coulomb friction compensator for servo control systems

A new Coulomb friction compensator is proposed for servo control systems in this paper. The novelty of the new approach lies in its capability of assigning the eigenvalues of the resulting closed loop system while attacking the problem. First, based on the standard backstepping methodology, an implicit Lyapunov function, with part of the components being only symbolically constructed at the very beginning, is utilized. To increase the robustness of the system against disturbance and model inaccuracy, an integral term is employed in the design. Using part of the variable gradient method, we are able to turn the implicit Lyapunov function into an explicit one, which is positive definite, and whose time‐derivative is negative definite. Second, it will be shown that the resulting closed loop error system is a switched linear system with two possible active modes that share the same set of eigenvalues, which is at our disposal. Unlike the common adaptive control design methods, such as the Control Lyapunov Function approach, in which the gains are typically positive but otherwise arbitrary, and are hence difficult to choose and have a lack of connection with the system's performance, our new scheme imposes two further constraints on the gains. It turns out that we can then match these gains with the coefficients of the desired characteristic equation of the closed loop system. In this respect, the gains are linked to the system's overall performance, which is a new and very appealing feature for such a scheme. Finally, a procedure of constructing a common Lyapunov function is provided to prove exponential stability of the aforementioned switched linear system. In addition, using the invariance principle, we will show the convergence of the estimated Coulomb friction coefficient to its real value. Numerical simulations are given to validate the effectiveness of the design and its robustness against friction time‐variations. Compared to existing results, the proposed scheme is much simpler, hence, much more advantageous computationally. Copyright © 2009 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society