Nonlinear model predictive control with relevance vector regression and particle swarm optimization

In this paper, a nonlinear model predictive control strategy which utilizes a probabilistic sparse kernel learning technique called relevance vector regression （RVR） and particle swarm optimization with controllable random exploration velocity （PSO-CREV） is applied to a catalytic continuous stirred tank reactor （CSTR） process. An accurate reliable nonlinear model is first identified by RVR with a radial basis function （RBF） kernel and then the optimization of control sequence is speeded up by PSO-CREV. Additional stochastic behavior in PSO-CREV is omitted for faster convergence of nonlinear optimization. An improved system performance is guaranteed by an accurate sparse predictive model and an efficient and fast optimization algorithm. To compare the performance, model predictive control （MPC） using a deterministic sparse kernel learning technique called Least squares support vector machines （LS-SVM） regression is done on a CSTR. Relevance vector regression shows improved tracking performance with very less computation time which is much essential for real time control.     

迭代重加权最小二乘支持向量机快速算法研究

迭代重加权(Iteratively Reweighted)方法是提高最小二乘支持向量机(LS-SVM)稳健性的重要手段,但由于涉及到多次加权和重复训练,该方法需要大量运算,无法广泛应用.通过数值推导,获得了求解迭代重加权最小二乘支持向量机(IRLS-SVM)的快速算法,大幅度减少了其运算复杂度.引入了3种经典的加权函数,并在多个仿真数据集和实际数据集上进行实验,证实了IRLS-SVM能获得相当稳健的学习结果,所提出的快速算法也确实能够大幅度减少训练时间.实验结果同时表明,在快速训练算法的框架下,3种不同的权重函数可能要求不同的训练时间.     

Predicting defect-prone software modules using support vector machines

Effective prediction of defect-prone software modules can enable software developers to focus quality assurance activities and allocate effort and resources more efficiently. Support vector machines (SVM) have been successfully applied for solving both classification and regression problems in many applications. This paper evaluates the capability of SVM in predicting defect-prone software modules and compares its prediction performance against eight statistical and machine learning models in the context of four NASA datasets. The results indicate that the prediction performance of SVM is generally better than, or at least, is competitive against the compared models.     

Feature selection via sensitivity analysis of SVM probabilistic outputs

Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) learning. Like most feature-selection methods, the proposed method ranks all features in decreasing order of importance so that more relevant features can be identified. It uses a novel criterion based on the probabilistic outputs of SVM. This criterion, termed Feature-based Sensitivity of Posterior Probabilities (FSPP), evaluates the importance of a specific feature by computing the aggregate value, over the feature space, of the absolute difference of the probabilistic outputs of SVM with and without the feature. The exact form of this criterion is not easily computable and approximation is needed. Four approximations, FSPP1-FSPP4, are proposed for this purpose. The first two approximations evaluate the criterion by randomly permuting the values of the feature among samples of the training data. They differ in their choices of the mapping function from standard SVM output to its probabilistic output: FSPP1 uses a simple threshold function while FSPP2 uses a sigmoid function. The second two directly approximate the criterion but differ in the smoothness assumptions of criterion with respect to the features. The performance of these approximations, used in an overall feature-selection scheme, is then evaluated on various artificial problems and real-world problems, including datasets from the recent Neural Information Processing Systems (NIPS) feature selection competition. FSPP1-3 show good performance consistently with FSPP2 being the best overall by a slight margin. The performance of FSPP2 is competitive with some of the best performing feature-selection methods in the literature on the datasets that we have tested. Its associated computations are modest and hence it is suitable as a feature-selection method for SVM applications. Editor: Risto Miikkulainen.     

Diagnosability Analysis of a Class of Hierarchical State Machines

This paper addresses the problem of fault detection and isolation for a particular class of discrete event dynamical systems called hierarchical finite state machines (HFSMs). A new version of the property of diagnosability for discrete event systems tailored to HFSMs is introduced. This notion, called L₁-diagnosability, captures the possibility of detecting an unobservable fault event using only high level observations of the behavior of an HFSM. Algorithms for testing L₁-diagnosability are presented. In addition, new methodologies are presented for studying the diagnosability properties of HFSMs that are not L₁-diagnosable. These methodologies avoid the complete expansion of an HFSM into its corresponding flat automaton by focusing the expansion on problematic indeterminate cycles only in the associated extended diagnoser.

AptaCDSS-E: A classifier ensemble-based clinical decision support system for cardiovascular disease level prediction

Conventional clinical decision support systems are generally based on a single classifier or a simple combination of these models, showing moderate performance. In this paper, we propose a classifier ensemble-based method for supporting the diagnosis of cardiovascular disease (CVD) based on aptamer chips. This AptaCDSS-E system overcomes conventional performance limitations by utilizing ensembles of different classifiers. Recent surveys show that CVD is one of the leading causes of death and that significant life savings can be achieved if precise diagnosis can be made. For CVD diagnosis, our system combines a set of four different classifiers with ensembles. Support vector machines and neural networks are adopted as base classifiers. Decision trees and Bayesian networks are also adopted to augment the system. Four aptamer-based biochip data sets including CVD data containing 66 samples were used to train and test the system. Three other supplementary data sets are used to alleviate data insufficiency. We investigated the effectiveness of the ensemble-based system with several different aggregation approaches by comparing the results with single classifier-based models. The prediction performance of the AptaCDSS-E system was assessed with a cross-validation test. The experimental results show that our system achieves high diagnosis accuracy (>94%) and comparably small prediction difference intervals (<6%), proving its usefulness in the clinical decision process of disease diagnosis. Additionally, 10 possible biomarkers are found for further investigation.     

四元数五轴联动插补算法的研究

在深入分析五轴数控系统的运动机构配置的基础上,针对传统的基于矩阵或欧拉角的插补算法在旋转空间难以解决线性插值和加工要求等问题, 设计一种基于四元数五轴联动的插补算法,不仅简化了插补计算量,同时能够使刀具从一点平稳的运动到另一点,而且插补的轨迹更光滑连续.文章引入四元数理论,重点研究了四元数在构造数学模型和运动变换中的应用,并在Matlab中成功的进行了仿真.实验结果表明了该算法的可行性和可靠性.     

一种改进的支持向量机降维方法

提出了一种基于支持向量机的改进的降维方法.在输入和特征空间中,特征子集的选取分别根据原始特征每一维对分类的贡献来获得.最后,通过将输入和特征空间中的特征选取联合起来,得到了一种改进的降维方法.实验表明:使用这种方法,在保持对分类准确率不受明显的影响的同时,能大大地提高训练和预测的速度.     

基于支持向量机的参数自整定PID非线性系统控制

对非线性系统提出了一种基于支持向量机的自整定PID控制新方法.用支持向量机辨识系统的非线性关系,并对之进行线性化,提取出瞬时线性模型,采用最小方差的准则获取PID控制器的最优参数.为改善控制器的性能,提出了一些改进措施,包括使用一阶滤波器、控制器参数更新标准及惩罚系数的调整等.通过对典型非线性系统的仿真,验证了该方法的有效性和可行性.     

决策树支持向量机多分类器设计的向量投影法

针对如何有效地设计决策树支持向量机(SVM)多类分类器的层次结构这个关键问题,提出一种基于向量投影的类间可分性测度的设计方法,并给出一种基于该类间可分性测度设计决策树SVM多分类器层次结构的方法.为加快每个SVM子分类器的训练速度且保持其高推广性,将基于向量投影的支持向量预选取方法用于每个子分类器的训练中.通过对3个大规模数据集和手写体数字识别的仿真实验表明,新方法能有效地提高决策树SVM多类分类器的分类精度和速度.