# An Optimal SVM with Feature Selection Using Multiobjective PSO

Authors: Iman Behravan; Oveis Dehghantanha; Seyed Hamid Zahiri; Nasser Mehrshad
Journal: Journal of Optimization
 (2016)

---

## Abstract

Support vector machine is a classifier, based on the structured risk minimization principle. The performance of the SVM depends on different parameters such as penalty factor,C, and the kernel factor, σ. Also choosing an appropriate kernel function can improve the recognition score and lower the amount of computation. Furthermore, selecting the useful features among several features in dataset not only increases the performance of the SVM, but also reduces the computational time and complexity. So this is an optimization problem which can be solved by heuristic algorithm. In some cases besides the recognition score, the reliability of the classifier’s output is important. So in such cases a multiobjective optimization algorithm is needed. In this paper we have got the MOPSO algorithm to optimize the parameters of the SVM, choose appropriate kernel function, and select the best feature subset simultaneously in order to optimize the recognition score and the reliability of the SVM concurrently. Nine different datasets, from UCI machine learning repository, are used to evaluate the power and the effectiveness of the proposed method (MOPSO-SVM). The results of the proposed method are compared to those which are achieved by single SVM, RBF, and MLP neural networks.


---

## Body

## 1. Introduction

A pattern recognition system consists of different parts. One of the most important parts of such a system is classifying, which is done by different classifiers at the end of the process. Obviously, having a powerful classifier with high accuracy is critical in a pattern recognition system, since the output accuracy of the system is highly affected by the accuracy of the classifier. So an accurate pattern recognition system which can be used in different applications strongly needs a high performance classifier. One of the powerful classification techniques is support vector machine, briefly called SVM [1]. SVM is a supervised learning method that constructs a classification model using training data. SVM minimizes the generalization error and maximizes the geometric margin between two classes. This classifier uses a kernel function to map the input data into a high-dimensional feature space in order to find an optimal hyperplane to separate the two-class data. The performance of the SVM depends on the amount of kernel parameter, σ, and the amount of penalty factor, C. Also choosing an appropriate kernel function is important. Furthermore, selecting the useful features among several features in the training dataset to train SVM plays an important role in improving the performance of the SVM. So, before training the SVM, the user should select a suitable kernel function and also optimal amounts for kernel parameter and penalty factor. Besides that, as mentioned before, feature selection is important for improving the performance and reducing the complexity. To solve this problem different methods based on heuristic algorithms have been proposed. For example, Huang and Wang have used GA to optimize the SVM’s parameters and also performing feature selection simultaneously in order to increase the classification accuracy [2]. They used RBF kernel in all experiments. Samanta et al. have proposed a GA-SVM method for bearing fault detection in rotating machines [3]. They had genetic algorithm, optimize the parameters of SVM, and also perform feature selection to improve the SVM ability in recognizing the vibration signals. Wu et al. proposed a method, based on GA and SVM, for predicting bankruptcy [4]. They have used GA only to optimize the classifier’s parameters without feature selection. Like GA, other optimization algorithms such as PSO and SA have been used to promote the SVM’s performance in different practical fields like Biomedical [5–7] and Face Recognition [8]. Another important point that is not considered in the mentioned researches is the reliability of the classifier, which means the validation of the classifier’s output. This is a very critical point that should be considered in selecting a classifier for different applications such as military and medicine. In all mentioned researches, the researchers have used only one fitness function to evaluate their methods. But, in addition to recognition score, calculating the reliability of the classifier’s output is a good way to evaluate the performance of the classifier. Reliability means the validation of the classifier’s output, for an unknown sample. In some problems, although the recognition score of a class is high, the corresponding reliability of that class may be low, and vice versa. Figure 1 shows this concept. According to Figure 1 the recognition score of the hollow circles is 100% but the corresponding reliability is (5/6) 83%. These numbers for dark circles are 80% and 100%, respectively.Figure 1
The recognition scores for the hollow circles and dark circles are 100% and 80%, respectively. The corresponding reliabilities are 83% and 100%, respectively.In this study multiobjective form of PSO has been used to find optimal hyperplanes for two objective functions: recognition score and reliability. The remainder of this paper is organized as follows. In Section2, SVM is briefly introduced. In Section 3, PSO and MOPSO algorithms are reviewed. In Section 4, two forms of artificial neural networks are reviewed as powerful methods in classification. In Section 5, the proposed method has been introduced. Section 6 shows the experimental results and the final section is devoted to conclusion.


## 2. Support Vector Machine

SVM is a two-class classifier described as follows [9]. Let xi,yi, 1<i<N, indicate a set of data containing N training samples. Each sample must conform to the criteria xi∈Rd. yi demonstrates the class of corresponding sample, xi. So yi∈{-1,1} and d indicates the number of dimensions of input data. The separating hyperplane can be derived as in (1)w·xi+b=0,1≤i≤N.If such a hyperplane exists, then linear separation is obtained. The samples which are nearest ones to the separating hyperplane are called support vectors. In boundaries (support vectors), (1) is reformed as (2)w·xi+b=±1.According to (2) for each sample (3) is true:(3)yi·w·xi+b≥1.So the problem is finding w and b. There are numerous hyperplanes which can separate the two-class data but SVM produces the optimal hyperplane as indicated in Figure 2. This hyperplane has the maximum distance to support vectors. The margin of a separating hyperplane is 2/w. So if we want to find the optimal hyperplane, we should minimize w. For simplicity we can substitute 1/2w2 with w. So we are dealing with an optimization problem. It means that we have to minimize 1/2w2 subjected to (3).Figure 2
Optimal hyperplane.In Figure2 the samples are linearly separable, but in most cases they cannot be separated as easy as indicated in Figure 2. For nonlinear problems positive slack variables ζi are introduced. So the problem changed into (4)Min12w2+C·∑i=1nζis.tyi·w·xi+b≥1-ζi,ζi≥0,1≤i≤N.In (4) C is called penalty factor. It is introduced to control the tradeoff between margin maximization and error minimization. This problem can be solved by means of Lagrange multipliers. Thus the classification decision function becomes(5)Fx=sign⁡∑i=1Nαi·yi·Kxi,xj+b,where αi is the Lagrange multiplier. K(xi,xj)=φ(xi)·φ(xj) is kernel function through some another mapping function, φ(x). QP solver is used to find αi. After that w and b can be achieved by(6)w=∑i=0Nαi·yi·φxi,(7)b=1NSV∑iyi-∑jαj·yj·Kxj,x.In (7) NSV is the number of support vectors and x is the input unknown sample.Some common kernel functions arelinear:k(x,y)=x·y+1,polynomial:k(x,y)=(x·y+1)σ,RBF:k(x,y)=exp⁡(-x-y/2·σ2),quadratic:1-x-y2/x-y+σ,in all of these functionsσ should be optimally tuned with C.


## 3. Particle Swarm Optimization Method

### 3.1. Single-Objective PSO

Particle swarm optimization algorithm is first suggested by Kennedy and Eberhart in 1995 [10]. This algorithm is produced by inspiration of birds flocking and fishes grouping. In fact they used the mechanism of birds flocking to solve optimization problems. It means that a group of particles search the solution space for the best solution. Each particle has a position, velocity, and a memory to save its best position from the beginning of the process. In each iteration the particle which has the best position is regarded as the leader and the other particles tend to reach its position. So their movement is affected by two factors: their best position from the first iteration to current iteration and the leader’s position. Equations (8) and (9) describe how particles move through iterations:(8)vidt+1=w·vidt+c1·rand·pbestd-xidt+c2·rand⁡pgbestd-xidt,(9)xidt+1=xidt+vidt.In the above equations, vid is the dth dimension of the velocity of the ith particle, x denotes the position of the particle, t is the number of iterations, c1 and c2 are learning factors, rand is a positive random number between 0 and 1 under normal distribution, w is the inertia weight coefficient, pbest is the best position of the particle from the beginning to current iteration, and pgbest shows the position of the leader in each iteration.


### 3.2. Multiobjective PSO

In a multiobjective optimization problem obviously, there is more than one objective function, to be optimized, so a multiobjective optimization problem can be defined as follows [11]:(10)MinimizeFx=f1x,f2x,…,fkxs.tgjx<0,hjx=0,where x=(x1,x2,…,xn) is a solution, fi, i=1,…,k, are objective functions, and gj, hj are constraints of the problem. Contrary to single-objective case, here we cannot find a single solution which is the best for all objective functions. Instead we are looking for a set of solutions. Actually there is a tradeoff between different objective functions. So the definition of the optimality is different in this case. We call x an optimal solution if another solution, like Y, cannot be found which has better fitness in all objective functions. Such a solution is a member of Pareto optimal front [12]. We say x1 is dominated by x2, if x2 is better than x1 in all objective functions. But if x1 is better just in one objective function than x2, it is nondominated. So in multiobjective form we have a set of solutions that contains nondominated particles. It means that the members of this set cannot dominate each other. Figure 3 shows Pareto optimal front for a two-objective function problem. According to this picture the solutions in the Pareto front dominate the other solutions but cannot dominate each other. In MOPSO each particle has a set of leaders and has to select one of them through a mechanism. Usually this set is called External Archive [13, 14]. External Archive contains nondominated particles from the first iteration.Figure 3
Pareto optimal front.In fact External Archive preserves outputs of the algorithm. Up to now different versions of MOPSO are introduced. In this study we have used the one introduced in [15] because of its speed and rapid convergence. In this form to select a leader for each particle, the solution space is divided into numerous hypercubes and different solutions from the External Archive exist in these hypercubes.They are placed in hypercubes according to their coordination calculated by objective functions. Each hypercube is evaluated through dividing the number of its solutions into a constant number. After evaluating each hypercube, roulette wheel mechanism will select one of these hypercubes. And finally a solution, placed in the selected hypercube, will be selected randomly as the leader for the particle. MOPSO process is described as follows:(1)
Initializing the position and the velocity of each particle.(2)
Evaluating the particles.(3)
Saving nondominated particles in a repository.(4)
Producing hypercubes to cover the solution space.(5)
Initializing the memory of each particle(11)pbesti=positioni.(6)
Main loop
(a)
Calculating the velocity of each particle by (8) (but in this form pgbestd should be replaced by rep[h]).(b)
Updating the position of the particles through (9).(c)
Evaluating the particles.(d)
Updating the repository.(e)
Updatingpbest for each particle.(7)
End of the main loop.


## 3.1. Single-Objective PSO

Particle swarm optimization algorithm is first suggested by Kennedy and Eberhart in 1995 [10]. This algorithm is produced by inspiration of birds flocking and fishes grouping. In fact they used the mechanism of birds flocking to solve optimization problems. It means that a group of particles search the solution space for the best solution. Each particle has a position, velocity, and a memory to save its best position from the beginning of the process. In each iteration the particle which has the best position is regarded as the leader and the other particles tend to reach its position. So their movement is affected by two factors: their best position from the first iteration to current iteration and the leader’s position. Equations (8) and (9) describe how particles move through iterations:(8)vidt+1=w·vidt+c1·rand·pbestd-xidt+c2·rand⁡pgbestd-xidt,(9)xidt+1=xidt+vidt.In the above equations, vid is the dth dimension of the velocity of the ith particle, x denotes the position of the particle, t is the number of iterations, c1 and c2 are learning factors, rand is a positive random number between 0 and 1 under normal distribution, w is the inertia weight coefficient, pbest is the best position of the particle from the beginning to current iteration, and pgbest shows the position of the leader in each iteration.


## 3.2. Multiobjective PSO

In a multiobjective optimization problem obviously, there is more than one objective function, to be optimized, so a multiobjective optimization problem can be defined as follows [11]:(10)MinimizeFx=f1x,f2x,…,fkxs.tgjx<0,hjx=0,where x=(x1,x2,…,xn) is a solution, fi, i=1,…,k, are objective functions, and gj, hj are constraints of the problem. Contrary to single-objective case, here we cannot find a single solution which is the best for all objective functions. Instead we are looking for a set of solutions. Actually there is a tradeoff between different objective functions. So the definition of the optimality is different in this case. We call x an optimal solution if another solution, like Y, cannot be found which has better fitness in all objective functions. Such a solution is a member of Pareto optimal front [12]. We say x1 is dominated by x2, if x2 is better than x1 in all objective functions. But if x1 is better just in one objective function than x2, it is nondominated. So in multiobjective form we have a set of solutions that contains nondominated particles. It means that the members of this set cannot dominate each other. Figure 3 shows Pareto optimal front for a two-objective function problem. According to this picture the solutions in the Pareto front dominate the other solutions but cannot dominate each other. In MOPSO each particle has a set of leaders and has to select one of them through a mechanism. Usually this set is called External Archive [13, 14]. External Archive contains nondominated particles from the first iteration.Figure 3
Pareto optimal front.In fact External Archive preserves outputs of the algorithm. Up to now different versions of MOPSO are introduced. In this study we have used the one introduced in [15] because of its speed and rapid convergence. In this form to select a leader for each particle, the solution space is divided into numerous hypercubes and different solutions from the External Archive exist in these hypercubes.They are placed in hypercubes according to their coordination calculated by objective functions. Each hypercube is evaluated through dividing the number of its solutions into a constant number. After evaluating each hypercube, roulette wheel mechanism will select one of these hypercubes. And finally a solution, placed in the selected hypercube, will be selected randomly as the leader for the particle. MOPSO process is described as follows:(1)
Initializing the position and the velocity of each particle.(2)
Evaluating the particles.(3)
Saving nondominated particles in a repository.(4)
Producing hypercubes to cover the solution space.(5)
Initializing the memory of each particle(11)pbesti=positioni.(6)
Main loop
(a)
Calculating the velocity of each particle by (8) (but in this form pgbestd should be replaced by rep[h]).(b)
Updating the position of the particles through (9).(c)
Evaluating the particles.(d)
Updating the repository.(e)
Updatingpbest for each particle.(7)
End of the main loop.


## 4. Artificial Neural Networks

Artificial neural network is introduced in 1974 [16]. The aim of this network is to extract logical results from received information by simulating the activity of the brain using a similar structure. In fact, artificial neural networks are organized in such a way that the relationships between inputs and outputs (which can be complex or nonlinear) are saved in a network structure and are therefore capable of assigning the related output to each of the inputs. After determining the structural components of these networks, the components of this structure are modified based on numerous comparisons between the output of the network and the desired output, so that the difference between these two values approaches zero over consecutive comparisons. In this sense, a neural network can be considered as a blind model that is able to perform the mapping (not necessarily linear) from input (vector) space to output (vector) space. In this paper we have used two of the most widely used artificial neural networks, the multilayer perceptron neural network (MLP) and radial basis function neural network (RBF), and totally compared capability of them with optimal support vector machine.


### 4.1. The Multilayer Perceptron Neural Network (MLP)

The simplest perceptron neural network consists of three (input, hidden, and output) layers as shown in Figure4. The numbers of neurons in each layer are determined using the trial and error method. The initial weights of this neural network are determined randomly. The backpropagation error algorithm is used for training the neural network in which the weights of the network change in a supervised manner based on the difference between the neural network output and desired output, so, for the every input, the output can be generated by the neural network. The input and output patterns are first normalized by a normalizing factor in order to equalize the effect of training process in changing the weights of the network in the training process. For the pth input pattern, the squared error in all neurons is calculated using the following equation:(12)Ep=12dp-yp2=12∑j=1njdjp-yjp2,where djp and yjp are, respectively, the values for desired output and calculated output in the jth neuron for pattern p. Total squared error for all patterns can also be calculated using the following equation:(13)E=∑p=1NEp=12∑p=1np∑j=1njdjp-yjp.In the following equations wijt+1 represents current weight, wijt represents previous weight, η represents learning coefficient, and α represents momentary coefficient:(14)wijt+1=wijt+ηdΔwijt+αΔwijt+1,Δwij=-δEpδwijt.Figure 4
A multilayer perceptron neural network.In this method weights are updated repeatedly for all learning patterns. The training process stops when the total error value for all patterns reaches a value lower than the determined critical point or when the whole learning period reaches the final point. It is noteworthy that the training method mentioned here is an error backpropagation method with momentary term, which lowers the possibility of coordination at local minima compared with the error backpropagation method.


### 4.2. Radial Basis Function (RBF) Neural Network

RBF is a popular supervised neural network learning algorithm. It is a specific kind of MLP network [17]. The RBF network is constituted by only the following three layers as shown in Figure 5:Input Layer. It broadcasts the inputs without distortion.RBF Layer. Hidden layer contains the RBF.Output Layer. Simple layer contains a linear function.Figure 5
A radial basis function neural network.Basis functions normally take the formϕ=x→i-μ→i. The function depends on the distance (usually taken to be Euclidean) between the input vector x→ and a vector μ→i. The most common form of basis function used is the Gaussian function(15)ϕ=expx→i-μ→i2σj2,where μ→i determines the center of basis function and σj is a width parameter that controls how the curve is spread. Generally, these centers are selected by using some fuzzy or nonfuzzy clustering algorithms. In this work, we have used the K-means algorithm to select the initial cluster centers in the first stage and then these centers are further fine-tuned by using point symmetry distance measure. The number of neurons in the output layer is equal to the number of classes of the classification problem. Each output layer neuron computes a linear weighted sum of the outputs of the hidden layer neurons as follows:(16)yix=∑i=1NϕiX·wi.The weight vectors are determined by minimizing the mean squared differences between the classifier outputs:(17)yk=∑j=0mwk,jsi.And target values tk are as follows:(18)E=12∑k=1Myk-tk2.The parameters (Δw,Δμ,Δσ) are given by (for more explication, see [17])(19)∂E∂wki=∂E∂yk∂yk∂wkior(20)∂E∂yk=tk-yk.Thus(21)∂E∂wki=-tk-yksi.After computation, we obtain(22)∂E∂μji=∑k∂E∂yk∂yk∂sj∂sj∂μji=sjσj2xi-μji∑i=1tk-ykwkj,∂E∂σji=∑k∂E∂yk∂yk∂sj∂sj∂σji=2sjσjlog⁡sj∑i=1tk-ykwkj.


## 4.1. The Multilayer Perceptron Neural Network (MLP)

The simplest perceptron neural network consists of three (input, hidden, and output) layers as shown in Figure4. The numbers of neurons in each layer are determined using the trial and error method. The initial weights of this neural network are determined randomly. The backpropagation error algorithm is used for training the neural network in which the weights of the network change in a supervised manner based on the difference between the neural network output and desired output, so, for the every input, the output can be generated by the neural network. The input and output patterns are first normalized by a normalizing factor in order to equalize the effect of training process in changing the weights of the network in the training process. For the pth input pattern, the squared error in all neurons is calculated using the following equation:(12)Ep=12dp-yp2=12∑j=1njdjp-yjp2,where djp and yjp are, respectively, the values for desired output and calculated output in the jth neuron for pattern p. Total squared error for all patterns can also be calculated using the following equation:(13)E=∑p=1NEp=12∑p=1np∑j=1njdjp-yjp.In the following equations wijt+1 represents current weight, wijt represents previous weight, η represents learning coefficient, and α represents momentary coefficient:(14)wijt+1=wijt+ηdΔwijt+αΔwijt+1,Δwij=-δEpδwijt.Figure 4
A multilayer perceptron neural network.In this method weights are updated repeatedly for all learning patterns. The training process stops when the total error value for all patterns reaches a value lower than the determined critical point or when the whole learning period reaches the final point. It is noteworthy that the training method mentioned here is an error backpropagation method with momentary term, which lowers the possibility of coordination at local minima compared with the error backpropagation method.


## 4.2. Radial Basis Function (RBF) Neural Network

RBF is a popular supervised neural network learning algorithm. It is a specific kind of MLP network [17]. The RBF network is constituted by only the following three layers as shown in Figure 5:Input Layer. It broadcasts the inputs without distortion.RBF Layer. Hidden layer contains the RBF.Output Layer. Simple layer contains a linear function.Figure 5
A radial basis function neural network.Basis functions normally take the formϕ=x→i-μ→i. The function depends on the distance (usually taken to be Euclidean) between the input vector x→ and a vector μ→i. The most common form of basis function used is the Gaussian function(15)ϕ=expx→i-μ→i2σj2,where μ→i determines the center of basis function and σj is a width parameter that controls how the curve is spread. Generally, these centers are selected by using some fuzzy or nonfuzzy clustering algorithms. In this work, we have used the K-means algorithm to select the initial cluster centers in the first stage and then these centers are further fine-tuned by using point symmetry distance measure. The number of neurons in the output layer is equal to the number of classes of the classification problem. Each output layer neuron computes a linear weighted sum of the outputs of the hidden layer neurons as follows:(16)yix=∑i=1NϕiX·wi.The weight vectors are determined by minimizing the mean squared differences between the classifier outputs:(17)yk=∑j=0mwk,jsi.And target values tk are as follows:(18)E=12∑k=1Myk-tk2.The parameters (Δw,Δμ,Δσ) are given by (for more explication, see [17])(19)∂E∂wki=∂E∂yk∂yk∂wkior(20)∂E∂yk=tk-yk.Thus(21)∂E∂wki=-tk-yksi.After computation, we obtain(22)∂E∂μji=∑k∂E∂yk∂yk∂sj∂sj∂μji=sjσj2xi-μji∑i=1tk-ykwkj,∂E∂σji=∑k∂E∂yk∂yk∂sj∂sj∂σji=2sjσjlog⁡sj∑i=1tk-ykwkj.


## 5. Proposed Method

In this paper we have used MOPSO to optimize penalty factor, choose adequate kernel function, tune the selected kernel’s parameter, and feature selection for two objective functions, recognition score and reliability, and its performance is compared with RBF and MLP neural networks. The construction of particles is indicated in Figure6.Figure 6
Construction of particles.The first variable,C, is for tuning penalty factor. Kn is for selecting kernel functions. The amount of this variable can be 1, 2, 3, or 4 to choose one kernel among the four kernels introduced in Section 2. σ is for selecting the selected kernel’s parameter (except linear). The rest of the particle is for feature selection. For a dataset with n number of features, F1,F2,…,Fn are between 0 and 1. If they are less than or equal to 0.5, the corresponding feature is not selected. Conversely if they are bigger than 0.5, the corresponding feature is selected.If we consider the two classes as “positive” and “negative,“ then the predicted test samples can be divided into four groups:(1)
Samples which are “positive” and correctly predicted as “positive” (TP).(2)
Samples which are “positive” but classified as “negative” (FN).(3)
Samples which are “negative” and correctly classified as “negative” (TN).(4)
Samples which are “negative” but predicted as “positive” (FP).According to this categorization, recognition score is calculated by(23)RecognitionScore=TP+TNTP+TN+FN+FPand the reliability for each class equals (24)Pos-reliability=TPTP+FN,Neg-reliability=TNTN+FP.The termination criteria are that the iteration number reaches 200. To calculate the fitness functions, for each particle, SVM should be trained by the determined parameters, kernel function, and selected features and then recognition score and reliability for each class can be achieved by (23) to (24). For multiclass classification we have used one-versus-all method. In this method for each class of the dataset we found the optimal hyperplane, which separates the corresponding class from the others. Thus the input sample is labeled according to the opinion of the obtained hyperplanes about that sample. Figure 7 shows this method for a 3-class dataset.Figure 7
Classifying of a 3-class dataset with one-versus-all method.


## 6. Experimental Results

The suggested method applied to nine different datasets from UCI machine learning repository [18]. In Table 1 the characteristics of these datasets are shown. Table 2 shows the experimental results on these datasets, Table 3 contains the learning time for different methods, and Table 4 shows the results of proposed method in classifying different datasets with and without feature selection.Table 1
Characteristics of used datasets.
Dataset Number of classes Number of samples Number of features Glass 6 214 9 Iris 3 150 4 Wine 3 175 13 German 2 1000 20 Ionosphere 2 351 33 Sonar 2 208 60 Hepatitis 2 80 19 Bupa 2 345 6 Vowel 11 990 13 Heart 2 270 13Table 2
Percentage of recognition score and reliability.
Glass Iris Wine German Ionosphere Sonar Hepatitis Bupa Vowel Heart MOPSO-SVM Recognition score 81.31 94.67 97.75 84.20 92.31 90.87 96.25 82.32 97.78 87.41 Reliability 92.94 97.93 100 89.89 93.99 90.85 92.095 82.06 99.89 87.3 SVM Recognition score 61.21 82.33 90.45 78.35 92.59 83.41 92.5 73.04 97.17 83.88 Reliability 94.64 98.45 99.65 79.57 92.98 87 89.87 72.77 99.89 85.49 MLP Recognition score 82.78 98.54 98.42 89.86 96.44 93.76 92.76 87.94 77.6 92.8 Reliability 73.088 98.68 98.438 88.35 96.35 93.97 86.51 87.59 78.30 92.82 RBF Recognition score 81.76 96.92 81.58 91.5 90.02 94.72 94.78 88.12 99.12 83.7 Reliability 75.822 96.96 88.87 94.94 93.11 94.86 97.07 91.49 99.3 86.59Table 3
Learning time for different classifiers (second).
Glass Iris Wine German Ionosphere Sonar Hepatitis Bupa Vowel Heart MOPSO-SVM 0.64 0.204 0.224 0.635 0.184 0.084 0.0436 0.191 11.85 0.118 SVM 2.74 1.138 1.12 0.663 0.179 0.116 0.0423 0.148 8.60 0.135 MLP 22.17 2.14 2.06 37.84 2.24 3.43 2.12 4.93 38.13 2.33 RBF 5.27 3.55 4.08 21.17 11.28 5.98 3.005 3.78 18.9 6.21Table 4
MOPSO-SVM with and without feature selection.
Glass Iris Wine German Ionosphere Sonar Hepatitis Bupa Vowel Heart With feature selection Recognition score 81.31 94.67 97.75 84.20 92.31 90.87 96.25 82.32 97.78 87.41 Reliability 92.94 97.93 100 89.89 93.99 90.85 92.095 82.06 99.89 87.3 Without feature selection Recognition score 71.50 95.33 97.19 84.30 92.02 87.98 95 81.16 96.06 84.07 Reliability 84.5 96.68 98.41 90.84 94.12 88.81 90.815 80.64 99.68 83.89According to Table2 it can be seen that MOPSO-SVM gives comparable and also better results than MLP and RBF neural networks for Glass, Iris, Wine, Ionosphere, Hepatitis, and Vowel datasets. The important point demonstrated in Table 2 is the rates of reliabilities given for different datasets. As indicated in Table 2, the proposed method gives high rates of reliabilities for most of the datasets, meaning that the output of the promoted classifier is strongly reliable.In fact since the hyperplanes obtained by MOPSO have an amount of errors in classifying of the test samples (unknown samples), some samples exist that more than one hyperplane assigns them to their corresponding classes. Also there may be some samples that none of the hyperplanes assign them to their corresponding classes. Such samples are considered as error samples, at which their classes cannot be distinguished. Figure8 illustrates this concept. Another point that is obviously seen from Table 2 is that MOPSO-SVM outperforms the original SVM in most of the experiments. It means that the proposed method is an expert classifier which automatically finds the optimal SVM parameters and best feature subset for classifying different datasets. It should be noted that in all the experiments different kernel functions were chosen for single SVM and the amounts of the recognition score and reliability reported for single SVM written in Table 2 are the average results of different SVM with different kernel functions.Figure 8
Samples which are considered as error samples.Analyzing the numbers seen in Table2, we can conclude that MOPSO-SVM is a powerful and effective classifier, due to rates of reliabilities and recognition scores achieved by this method for different datasets. These numbers show that MOPSO-SVM is a reliable classifier which means that this promoted classifier can act perfectly in special applications such as military and medicine which strongly require a high-reliable classifier. Table 3 contains the learning time for different algorithms. Comparing to single SVM, MOPSO-SVM requires less learning time in most experiments. This is the result of feature selection. In fact removing redundant features from datasets results in reduction of learning time. Also proposed method has less learning time than MLP and RBF neural networks. In Table 4 the results of proposed method with and without feature selection are shown. According to this table, feature selection process has improved the recognition score and reliability for most of the datasets. It means that feature selection process is an efficient preprocessing technique which not only has the ability to reduce the learning time of the classifier but also can improve its performance. This is an important issue especially in classifying or clustering high-dimensional data. From the reported results, it is clear that using heuristic algorithm to enhance the performance of the SVM for two objective functions is a successful idea because finding optimal parameters of SVM for different datasets and also reducing the dimension of the dataset are a hard task. For example for Sonar samples, which have 60 features, there exists 260 feature subset, so it is very difficult to find the best feature subsets. Furthermore finding the optimal amounts of the parameters in order to improve the performance of the SVM is a difficult task. In fact finding an optimal SVM with optimal feature subset is an NP-hard problem which can be solved with heuristic algorithm. According to the reported results, MOPSO searches the solution space very effectively.


## 7. Conclusion

In this study multiobjective PSO has been used to tune the parameters of SVM and also perform feature selection for two objective functions and the performance of the proposed method (MOPSO-SVM) has been compared with single SVM, RBF, and MLP neural networks. According to the reported results, it can be seen that the proposed method gives reliabilities and recognition scores, comparable with RBF and MLP neural networks, which have shown their effectiveness in classifying overlapped datasets, and in some cases even gives better reliabilities and/or recognition scores than RBF and MLP, for example, for Glass, Iris, Wine, Ionosphere, Hepatitis, and Vowel datasets. Also the proposed method has less learning time in most of the experiments. Furthermore according to Tables3 and 4, feature selection is an important preprocessing method which has positive effect both on learning time and on the accuracy of the classifier.Actually the results shown in the previous section indicate that using heuristic algorithm to convert SVM from a normal classifier into an expert one was successful. Furthermore optimizing SVM in order to increase its reliability besides its accuracy by using a multiobjective heuristic algorithm is a successful idea according to the obtained results. The reported results also show the power and effectiveness of MOPSO in searching the solution space. In other words, MOPSO is a powerful algorithm which can act very effectively in solving multiobjective optimization problems.



---

*Source: 6305043-2016-07-18.xml*