基于混合最小二乘支持向量机网络模型的非线性系统辨识

针对基于输入输出数据的非线性系统辨识问题,提出一种新的混合最小二乘支持向量机(LS-SVMs)网络模型及相应的学习算法.该算法将系统的辨识问题动态自适应的划分为若干子问题,将支持向量机(SVM)用于各子模块辨识;通过分析模型的统计学特性,给出基于整体框架优化的系统参数辨识方法.针对系统中参数相关联的特性,采用期望条件最大化(ECM)算法对其进行条件辨识,同时结合正则化理论和最小二乘法,保证各专家模块的结构风险最小化辨识原则.试验结果表明,该方法兼具良好的辨识精度和泛化性能.     

转炉煤气柜位的多输出最小二乘支持向量机预测

针对钢铁企业转炉煤气系统中煤气柜位的预测问题,提出一种一致T型灰色关联分析确定柜位的主要影响用户,避免了冗余输入因素,降低了预测模型的复杂度.根据多个不同煤气柜同时并网运行的情况,提出多输出最小二乘支持向量机回归算法来建立柜位预测模型.该算法采用等式约束,通过最小化所有输出的单一和整体拟合误差,将其转换为求解一系列线性方程组,得到模型回归函数的权系数和偏置公式表示.现场数据仿真实验结果表明所建预测模型的有效性和实用性,为制定煤气调配方案提供了合理指导.     

PSO并行优化LSSVR非线性黑箱模型辨识

针对非线性黑箱系统辨识中存在不确定性、高阶次,采用常规辨识方法建立其精确数学模型十分困难等问题,提出一种基于自适应粒子群算法的最小二乘支持向量机回归(PSO-LSSVR)非线性系统辨识方法.该方法采用2组自适应粒子群算法并行计算模型,分别利用自适应粒子群算法对LSSVR中的参数进行自动选取和矩阵迭代求解,既克服了传统LSSVR参数难以确定的缺点,提高了辨识精度,同时避免了复杂矩阵求逆运算,加快了计算速度.将该方法应用于船舶操纵性模型非线性系统辨识,仿真结果表明,由该方法得到的LSSVR能够有效地对系统进行建模,仿真精度高,结构简单,具有一定的理论推广意义.     

齐次等式约束线性回归模型条件根方估计的效率

对齐次等式约束线性回归模型回归系数的约束最小二乘估计提出改进,引入一种估计的相对效率,证明在一定条件下,狭义条件根方估计、广义条件根方估计的效率均高于约束最小二乘估计的效率．     

The automatic model selection and variable kernel width for RBF neural networks

The Orthogonal Least Squares (OLS) algorithm has been extensively used in basis selection for RBF networks, but it is unable to perform model selection automatically because the tolerance ρ must be specified manually. This introduces noise and it is difficult to implement in the parametric complexity of real-time system. Therefore, a generic criterion that detects the optimum number of its basis functions is proposed. In this paper, not only the Bayesian Information Criterion (BIC) method, used for fitness calculation, is incorporated into the basis function selection process of the OLS algorithm for assigning its appropriate number, but also a new method is developed to optimize the widths of the Gaussian functions in order to improve the generalization performance. The augmented algorithm is employed to the Radial Basis Function Neural Networks (RBFNN) for known and unknown noise nonlinear dynamic systems and its performance is compared with the standard OLS; experimental results show that both the efficacy of BIC for fitness calculation and the importance of proper choice of basis function widths are significant.     

Simultaneous kinetic spectrophotometric determination of sulfide and sulfite ions by using an optode and the partial least squares (PLS) regression

The characterization of an optical sensor membrane is described for simultaneous determination of sulfite and sulfide ions based on the immobilization of crystal violet on a triacetylcellulose membrane. The absorbance of the membranes decreased by increasing sulfite and sulfide concentration. The partial least squares (PLS-1) calibration model based on spectrophotometric measurement for simultaneous determination of sulfite and sulfide ions was applied. This method is based on the difference between the rate of the reaction of sulfide and sulfite with membranes in pH 7.0 buffer solution and at 25 °C. The experimental calibration matrix for partial least squares (PLS-1) calibration was designed with 18 samples. The cross-validation method was used for selecting the number of factors. The results showed that simultaneous determination could be performed in the range of 200–2000 μg mL⁻¹ (2.5–25 mmol L⁻¹) and 80–900 μg mL⁻¹ (2.5–28.125 mmol L⁻¹) for sulfite and sulfide, respectively. The sensor can readily be regenerated with water and the color is fully reversible. The sensor was successfully applied to the simultaneous determination of sulfide and sulfite in water samples.     

Comparison of different classifier algorithms for diagnosing macular and optic nerve diseases

Abstract: The aim of this research was to compare classifier algorithms including the C4.5 decision tree classifier, the least squares support vector machine (LS-SVM) and the artificial immune recognition system (AIRS) for diagnosing macular and optic nerve diseases from pattern electroretinography signals. The pattern electroretinography signals were obtained by electrophysiological testing devices from 106 subjects who were optic nerve and macular disease subjects. In order to show the test performance of the classifier algorithms, the classification accuracy, receiver operating characteristic curves, sensitivity and specificity values, confusion matrix and 10-fold cross-validation have been used. The classification results obtained are 85.9%, 100% and 81.82% for the C4.5 decision tree classifier, the LS-SVM classifier and the AIRS classifier respectively using 10-fold cross-validation. It is shown that the LS-SVM classifier is a robust and effective classifier system for the determination of macular and optic nerve diseases.     

Recursive reduced least squares support vector regression

Combining reduced technique with iterative strategy, we propose a recursive reduced least squares support vector regression. The proposed algorithm chooses the data which make more contribution to target function as support vectors, and it considers all the constraints generated by the whole training set. Thus it acquires less support vectors, the number of which can be arbitrarily predefined, to construct the model with the similar generalization performance. In comparison with other methods, our algorithm also gains excellent parsimoniousness. Numerical experiments on benchmark data sets confirm the validity and feasibility of the presented algorithm. In addition, this algorithm can be extended to classification.     

IP-LSSVM: A two-step sparse classifier

We present in this work a two-step sparse classifier called IP-LSSVM which is based on Least Squares Support Vector Machine (LS-SVM). The formulation of LS-SVM aims at solving the learning problem with a system of linear equations. Although this solution is simpler, there is a loss of sparseness in the feature vectors. Many works on LS-SVM are focused on improving support vectors representation in the least squares approach, since they correspond to the only vectors that must be stored for further usage of the machine, which can also be directly used as a reduced subset that represents the initial one. The proposed classifier incorporates the advantages of either SVM and LS-SVM: automatic detection of support vectors and a solution obtained simply by the solution of systems of linear equations. IP-LSSVM was compared with other sparse LS-SVM classifiers from literature, and RRS+LS-SVM. The experiments were performed on four important benchmark databases in Machine Learning and on two artificial databases created to show visually the support vectors detected. The results show that IP-LSSVM represents a viable alternative to SVMs, since both have similar features, supported by literature results and yet IP-LSSVM has a simpler and more understandable formulation.     

Improving the generalization performance of RBF neural networks using a linear regression technique

In this paper we present a method for improving the generalization performance of a radial basis function (RBF) neural network. The method uses a statistical linear regression technique which is based on the orthogonal least squares (OLS) algorithm. We first discuss a modified way to determine the center and width of the hidden layer neurons. Then, substituting a QR algorithm for the traditional Gram–Schmidt algorithm, we find the connected weight of the hidden layer neurons. Cross-validation is utilized to determine the stop training criterion. The generalization performance of the network is further improved using a bootstrap technique. Finally, the solution method is used to solve a simulation and a real problem. The results demonstrate the improved generalization performance of our algorithm over the existing methods.