Search

This paper proposes a new approach is referred to as condensed nearest neighbor decision rule (CNN) input weight sequential feed-forward neural networks (CIW-SFFNS). In this paper, it is firstly shown that the difference of optimization constraints between the extreme learning machine (ELM) and constrained-optimization-based extreme learning machine. For the second time, this paper proposes a method that using CNN to select the hidden-layer weights from example. Moreover, we compare error minimized extreme learning machines (EM-ELM), support vector sequential feed-forward neural networks (SV-SFFNS) and CIW-SFFNS from two aspects:test accuracy and the number of hidden nodes. We present the result of an experimental study on 10 classification sets. The CIW-SFFNS algorithm has a statistically significant improvement in generalization performance than EM-ELM and SV-SFFNS.

Core Vector Machine (CVM) can be used to deal with large data sets by find minimum enclosing ball (MEB), but one drawback is that CVM is very sensitive to the outliers. To tackle this problem, we propose a novel Position Regularized Core Vector Machine (PCVM).In the proposed PCVM, the data points are regularized by assigning a position-based weighting. Experimental results on several benchmark data sets show that the performance of PCVM is much better than CVM.

Active learning approach has been integrated with support vector machine or other machine-learning techniques in many areas. However, the challenge is: Unlabeled instances are often abundant or easy to obtain, but their labels are expensive and time-consuming to get in general. In spite of this, most existing methods cannot guarantee the usefulness of each query in learning a new classifier. In this paper, we propose a new active learning approach of selecting the most informative query for annotation. Unlabeled instance, which is nearest to the support vector machine’s hyperplane learnt from both the unlabeled instance itself and all labeled instances, is selected as the query for annotation. Merits of these queries in learning a new optimal hyperplane have been assured before they are annotated and put into the training set. Experimental results on several UCI datasets have shown the efficiency of our approach.

The integration of fuzzy sets and rough sets can lead to a hybrid soft-computing technique which has been applied successfully to many fields such as machine learning, pattern recognition and image processing. The key to this soft-computing technique is how to set up and make use of the fuzzy attribute reduct in fuzzy rough set theory. Given a fuzzy information system, we may find many fuzzy attribute reducts and each of them can have different contributions to decision-making. If only one of the fuzzy attribute reducts, which may be the most important one, is selected to induce decision rules, some useful information hidden in the other reducts for the decision-making will be losing unavoidably. To sufficiently make use of the information provided by every individual fuzzy attribute reduct in a fuzzy information system, this paper presents a novel induction of multiple fuzzy decision trees based on rough set technique. The induction consists of three stages. First several fuzzy attribute reducts are found by a similarity based approach, and then a fuzzy decision tree for each fuzzy attribute reduct is generated according to the fuzzy ID3 algorithm. The fuzzy integral is finally considered as a fusion tool to integrate the generated decision trees, which combines together all outputs of the multiple fuzzy decision trees and forms the final decision result. An illustration is given to show the proposed fusion scheme. A numerical experiment on real data indicates that the proposed multiple tree induction is superior to the single tree induction based on the individual reduct or on the entire feature set for learning problems with many attributes.

Various morphologies of silver films fabricated by the thermal decomposition of silver behenate have been studied. The morphological structures of silver behenate films at different heating temperatures are characterized by using SEM, IR and XRD. It is found that, while heating the silver behenate films, the formed silver particles are stabilized by the other thermal decomposition products in the range of 193°C∼320°C. The influence of silver behenate concentration in organic solvent on the formation and packing density of as-fabricated silver films by thermal treatment on the silver behenate films at 500°C has been studied. The results show that the silver film fabricated by a millimolar solution of silver behenate possesses a silver monolayer; the silver thick film can be formed at high concentration, and interestingly, silver particles with regular triangular or truncated triangular shape in the silver thick film are also obtained.

For the problem of imbalanced data classification which was not discussed in the standard Extreme Support Vector Machines (ESVM), an imbalanced extreme support vector machines (IESVM) was proposed. Firstly, a preliminary normal vector of separating hyperplane is obtained directly by geometric analysis. Secondly, penalty factors are obtained which are based on the information provided by data sets projecting onto the preliminary normal vector. Finally, the final separation hyperplane is got through the improved ESVM training. IESVM can overcome disadvantages of traditional designing methods which only consider the imbalance of samples size and can improve the generalization ability of ESVM. Experimental results show that the method can effectively enhance the classification performance on imbalanced data sets.

When the training dataset is very large, the learning process of potential support vector machine takes up so large memory that the training speed is very slow. To accelerate the training speed of the potential support vector machine (PSVM) for large-scale datasets, a new method is proposed, which introduces PSVM based on the reduced samples. The new method removes most non-support vectors, and keeps the samples on and near the boundary, which may be the support vectors, as the new training samples. This method is more suitable to large-scale datasets. The experimental results show that the proposed method performs well to decrease the consumption of computer memory, and accelerate the training speed of PSVM.

This paper proposes a new fuzzy multicategory support vector machines (FMSVM) classifier. The main idea is that the proposed FMSVM uses knowledge of the ambiguity associated with the membership of samples for a given class and the relative location of samples to the origin. Compared with the existing SVMs, the new proposed FMSVM that uses the L2-norm in the objective function has the improvement in aspects of classification accuracy and reducing the effects of noises and outliers.

This paper investigates an Improved Fuzzy Multicategory Support Vector Machines Classifier (IFMSVM). It uses knowledge of the ambiguity associated with the membership of data samples of a given class and relative location to the origin, to improve classification performance with high generalization capability. In some aspects, classifying accuracy of the new algorithm is better than that of the classical support vector classification algorithms. Numerical simulations show the feasibility and effectiveness of this algorithm.

Support vector machines (SVMs) are powerful tools for providing solutions to classification and function approximation problems. The comparison among the four classification methods is conducted. The four methods are Lagrangian support vector machine (LSVM), finite Newton Lagrangian support vector machine (NLSVM), smooth support vector machine (SSVM) and finite Newton support vector machine (NSVM). The comparison of their algorithm in generating a linear or nonlinear kernel classifier, accuracy and computational complexity is also given. The study provides some guidelines for choosing an appropriate one from four SVM classification methods in a classification problem.