SVD-LSSVM and its application in chemical pattern classification

Pattern classification is an important field in machine learning; least squares support vector machine (LSSVM) is a powerful tool for pattern classification. A new version of LSSVM, SVD-LSSVM, to save time of selecting hyper parameters for LSSVM is proposed. SVD-LSSVM is trained through singular value decomposition (SVD) of kernel matrix. Cross validation time of selecting hyper parameters can be saved because a new hyper parameter, singular value contribution rate (SVCR), replaces the penalty factor of LSSVM. Several UCI benchmarking data and the Olive classification problem were used to test SVD-LSSVM. The result showed that SVD-LSSVM has good performance in classification and saves time for cross validation.

Research on Natural Gas Short-Term Load Forecasting Based on Support Vector Regression

Natural gas load forecasting is a key process to the efficient operation of pipeline network. An accurate forecast is required to guarantee a balanced network operation and ensure safe gas supply at a minimum cost.Machine learning techniques have been increasingly applied to load forecasting. A novel regression technique based on the statistical learning theory, support vector machines (SVM), is investigated in this paper for natural gas shortterm load forecasting. SVM is based on the principle of structure risk minimization as opposed to the principle of empirical risk minimization in conventional regression techniques. Using a data set with 2 years load values we developed prediction model using SVM to obtain 31 days load predictions. The results on city natural gas short-term load forecasting show that SVM provides better prediction accuracy than neural network. The software package natural gas pipeline networks simulation and load forecasting (NGPNSLF) based on support vector regression prediction has been developed, which has also been applied in practice.

Yarn Properties Prediction Based on Machine Learning Method

Although many works have been done to construct prediction models on yarn processing quality,the relation between spinning variables and yarn properties has not been established conclusively so far.Support vector machines(SVMs),based on statistical learning theory,are gaining applications in the areas of machine learning and pattern recognition because of the high accuracy and good generalization capability.This study briefly introduces the SVM regression algorithms,and presents the SVM based system architecture for predicting yarn properties.Model selection which amounts to search in hyper-parameter space is performed for study of suitable parameters with grid-research method.Experimental results have been compared with those of artificial neural network(ANN)models.The investigation indicates that in the small data sets and real-life production,SVM models are capable of remaining the stability of predictive accuracy,and more suitable for noisy and dynamic spinning process.

Improved twin support vector machine

We improve the twin support vector machine(TWSVM)to be a novel nonparallel hyperplanes classifier,termed as ITSVM(improved twin support vector machine),for binary classification.By introducing the diferent Lagrangian functions for the primal problems in the TWSVM,we get an improved dual formulation of TWSVM,then the resulted ITSVM algorithm overcomes the common drawbacks in the TWSVMs and inherits the essence of the standard SVMs.Firstly,ITSVM does not need to compute the large inverse matrices before training which is inevitable for the TWSVMs.Secondly,diferent from the TWSVMs,kernel trick can be applied directly to ITSVM for the nonlinear case,therefore nonlinear ITSVM is superior to nonlinear TWSVM theoretically.Thirdly,ITSVM can be solved efciently by the successive overrelaxation(SOR)technique or sequential minimization optimization(SMO)method,which makes it more suitable for large scale problems.We also prove that the standard SVM is the special case of ITSVM.Experimental results show the efciency of our method in both computation time and classification accuracy.

Hierarchical Polytope ARTMAP for Supervised Learning

The recent Polytope ARTMAP（PTAM） suggests that irregular polytopes are more flexible than the predefined category geometries to approximate the borders among the desired output predictions.However,category expansion and adjustment steps without statistical information make PTAM not robust to noise and category overlap.In order to push the learning problem towards Structural Risk Minimization（SRM）,this paper proposes Hierarchical Polytope ARTMAP （HPTAM） to use a hierarchical structure with different levels,which are determined by the complexity of regions incorporating the input pattern.Besides,overlapping of simplexes from the same desired prediction is designed to reduce category proliferation.Although HPTAM is still inevitably sensible to noisy outliers in the presence of noise,main experimental results show that HPTAM can achieve a balance between representation error and approximation error,which ameliorates the overall generalization capabilities.