A new decision tree learning algorithm

In order to improve the generalization ability of binary decision trees, a new learning algorithm, the MMDT algorithm, is presented. Based on statistical learning theory the generalization performance of binary decision trees is analyzed, and the assessment rule is proposed. Under the direction of the assessment rule, the MMDT algorithm is implemented. The algorithm maps training examples from an original space to a high dimension feature space, and constructs a decision tree in it. In the feature space, a new decision node splitting criterion, the max-min rule, is used, and the margin of each decision node is maximized using a support vector machine, to improve the generalization performance. Experimental results show that the new learning algorithm is much superior to others such as C4. 5 and OCI.

Time series online prediction algorithm based on least squares support vector machine

Deficiencies of applying the traditional least squares support vector machine （LS-SVM） to time series online prediction were specified. According to the kernel function matrix＇s property and using the recursive calculation of block matrix, a new time series online prediction algorithm based on improved LS-SVM was proposed. The historical training results were fully utilized and the computing speed of LS-SVM was enhanced. Then, the improved algorithm was applied to timc series online prediction. Based on the operational data provided by the Northwest Power Grid of China, the method was used in the transient stability prediction of electric power system. The results show that, compared with the calculation time of the traditional LS-SVM（75 1 600 ms）, that of the proposed method in different time windows is 40-60 ms, proposed method is above 0.8. So the improved method is online prediction. and the prediction accuracy（normalized root mean squared error） of the better than the traditional LS-SVM and more suitable for time series online prediction.

Estimating coal reserves using a support vector machine

The basic principles of the Support Vector Machine (SVM) are introduced in this paper. A specific process to establish an SVM prediction model is given. To improve the precision of coal reserve estimation, a support vector machine method, based on statistical learning theory, is put forward. The SVM model was trained and tested by using the existing exploration and exploitation data of Chencun mine of Yima bureau’s as the input data. Then coal reserves within a particular region were calculated. These calculated results and the actual results of the exploration block were compared. The maximum relative error was 10.85%, within the scope of acceptable error limits. The results show that the SVM coal reserve calculation method is reliable. This method is simple, practical and valuable.

Support vector machine method for fore-casting future strong earthquakes in Chinese mainland

Statistical learning theory is for small-sample statistics. And support vector machine is a new machine learning method based on the statistical learning theory. The support vector machine not only has solved certain problems in many learning methods, such as small sample, over fitting, high dimension and local minimum, but also has a higher generalization （forecasting） ability than that of artificial neural networks. The strong earthquakes in Chinese mainland are related to a certain extent to the intensive seismicity along the main plate boundaries in the world, however, the relation is nonlinear. In the paper, we have studied this unclear relation by the support vector machine method for the purpose of forecasting strong earthquakes in Chinese mainland.

Randomized Algorithms for Probabilistic Optimal Robust Performance Controller Design

Polynomial-time randomized algorithms were constructed to approximately solve optimal robust performance controller design problems in probabilistic sense and the rigorous mathematical justification of the approach was given. The randomized algorithms here were based on a property from statistical learning theory known as (uniform) convergence of empirical means (UCEM). It is argued that in order to assess the performance of a controller as the plant varies over a pre-specified family, it is better to use the average performance of the controller as the objective function to be optimized, rather than its worst-case performance. The approach is illustrated to be efficient through an example.

Support Vector Machine-Based Nonlinear System Modeling and Control

This paper provides an introduction to a support vector machine, a new kernel-based technique introduced in statistical learning theory and structural risk minimization, then presents a modeling-control framework based on SVM. At last a numerical experiment is taken to demonstrate the proposed approach's correctness and effectiveness.

Estimating Military Aircraft Cost Using Least Squares Support Vector Machines

A multi-layer adaptive optimizing parameters algorithm is developed forimproving least squares support vector machines (LS-SVM) , and a military aircraft life-cycle-cost(LCC) intelligent estimation model is proposed based on the improved LS-SVM. The intelligent costestimation process is divided into three steps in the model. In the first step, a cost-drive-factorneeds to be selected, which is significant for cost estimation. In the second step, militaryaircraft training samples within costs and cost-drive-factor set are obtained by the LS-SVM. Thenthe model can be used for new type aircraft cost estimation. Chinese military aircraft costs areestimated in the paper. The results show that the estimated costs by the new model are closer to thetrue costs than that of the traditionally used methods.

Compression method based on training dataset of SVM

The method to compress the training dataset of Support Vector Machine （SVM） based on the character of the Support Vector Machine is proposed. First, the distance between the unit in two training datasets, and then the samples that keep away from hyper-plane are discarded in order to compress the training dataset. The time spent in training SVM with the training dataset compressed by the method is shortened obviously. The result of the experiment shows that the algorithm is effective.

A Measure of Learning Model Complexity by VC Dimension

When developing models there is always a trade-off between model complexity and model fit. In this paper, a measure of learning model complexity based on VC dimension is presented, and some relevant mathematical theory surrounding the derivation and use of this metric is summarized. The measure allows modelers to control the amount of error that is returned from a modeling system and to state upper bounds on the amount of error that the modeling system will return on all future, as yet unseen and uncollected data sets. It is possible for modelers to use the VC theory to determine which type of model more accurately represents a system.