Research Article  Open Access
A Multiple Kernel Learning Model Based on Norm
Abstract
By utilizing kernel functions, support vector machines (SVMs) successfully solve the linearly inseparable problems. Subsequently, its applicable areas have been greatly extended. Using multiple kernels (MKs) to improve the SVM classification accuracy has been a hot topic in the SVM research society for several years. However, most MK learning (MKL) methods employ norm constraint on the kernel combination weights, which forms a sparse yet nonsmooth solution for the kernel weights. Alternatively, the norm constraint on the kernel weights keeps all information in the base kernels. Nonetheless, the solution of norm constraint MKL is nonsparse and sensitive to the noise. Recently, some scholars presented an efficient sparse generalized MKL ( and norms based GMKL) method, in which established an elastic constraint on the kernel weights. In this paper, we further extend the GMKL to a more generalized MKL method based on the norm, by joining  and norms. Consequently, the  and norms based GMKL is a special case in our method when . Experiments demonstrated that our  and norms based MKL offers a higher accuracy than the  and norms based GMKL in the classification, while keeping the properties of the  and norms based on GMKL.
1. Introduction of MKL
The support vector machine (SVM) is a classification and regression tool based on the statistical machine learning [1]. By utilizing the kernel function, the SVM transfers the data into a high dimension space, builds an optimal separating hyperplane, and consequently solves the nonlinear problem. In solving an SVM problem, it is critical to choose an adequate kernel function. The widely used kernel functions are the radial basis functions and polynomial functions. To select an effective kernel function is very important, and different kernels and parameters produce different classification and regression results. In our paper, we try to use the features of different kernels and improve the classification accuracy of SVM.
The multiple kernel learning (MKL) model [2] is a flexible learning model. In the recent research, the MK learning (MKL) can obtain higher classification accuracy than the sole one. As the MKL uses different combinations of kernel functions and has larger flexibility, its performance is normally better. Constructing the MK model, in fact, is the process of seeking the combination of kernels to get the best classification accuracy. Thus, in the MK framework, to seek the weights of the different kernels is the big problem for MKL [3, 4]. The simplest form of MKL is norm [5]. The norm MKL finds the kernel weight in a simplex form and thus yields a sparse solution [6, 7]. The sparsity of selected kernels is helpful in identifying an appropriate combination of data sources or subsets with different features in real world applications. However, the method may discard useful information and thus result in a suboptimal generalization.
Alternatively, the norm MKL was proposed by another group of researchers, and it improves norm MKL in some scenarios. Unfortunately, the solution of norm MKL is nonsparse, which means it uses all kernels in the forecasting stage. Also, the norm MKL is sensitive to noise. Additionally, when there exist noisy data in the training set, the classification accuracy would be greatly decreased. Furthermore, it suffers poor interpretation and can lead to high computational and storage cost, too.
Thus, there is research intending to combine the norm MKL and norm MKL. The algorithm is called the generalized MKL (GMKL) [8], which combines both advantages of  and norms and is able to have a higher accuracy in classifications. Nonetheless, the GMKL algorithm is just specialized in the combination of the sparse MKL method and the nonsparse kernel learning method, norm MKL. The research made a contribution to the merging of the  and norm MKL, and the GMKL in a general model [9]. In this paper, we extend the algorithm in a more general form, which combines the sparse MKL and all nonsparse MKL algorithms. Thus, we would like to generalize the norm MKL to the norm.
In our paper, we combine  and norms [10], by extending the constraint of kernels as . We call our algorithm MKL based on norm (MKLBP). In particular, when the MKLBP algorithm will be degenerated into the GMKL algorithm. In our experiments, when , the accuracy of our algorithm tends to be stable and is higher than the results with . Meantime, compared with the  and norm MKL method, the MKLBP shows the higher accuracy in the classifications too. The advantage of using norms is that more flexibility can be achieved during the experiments. As changes, the generalization and precision vary accordingly.
The paper is organized as follows: Section 2 describes in detail the MKLBP model. Section 3 analyzes and verifies the relevant definitions and theorems of MKLBP model. The implementation solution of MKLBP model is described in Section 4. Section 5 uses the MKLBP model to carry out experiments on the UCI datasets and compares its accuracy, running time, and so on with those of other MKL models. Section 6 concludes this research with directions for future work.
2. Base Framework of MKLBP
Based on the statistics machine learning in the classification problem, we can get the general model below:
The smallest empirical risk is , while the smallest regulation risk is . The parameter is a presetting constant, used for balancing the empirical and regulation risks.
In the SVM, the model could be shown as
By optimizing problem (2), the classifier could be shown as
Using the Langrage function and kernel , , we could get the dual form of problem (2):
Problem (4) is a simplest form of SVM. In the MKL model, kernel is combined with a series of kernels linearly. The kernel is shown as
In (5), refers to the weight of kernel , and refers to the number of kernels. By using (5) and replacing in (4), we can get the standard form of MKL:where and refers to the constraint domain of . In the MKL model, the simplest domain is the norm MKL, where . The research shows that in the  and norm MKLs, where , there is better classification character in some aspects.
The research combined the  and norm MKLs, and the GMKL model. The paper showed that the novel model keeps the sparsity of the norm MKL and the classification accuracy does not decrease when facing the noisy data. Domain in the GMKL model is . The setting constant is used to balance the  and norm MKLs, and . The experiments showed that when , the model gets the best classification accuracy.
However, the paper just specialized the sparse and nonsparse MKL models. In this paper, we would like to generalize the model. Concretely, we generalize domain as . We called our model the MKL based on norm (MKLBP).
We would like to bring the character of our model in the next paragraph, where we will show the model keeping the character of GMKL. Then we give the algorithm of the model to solve the high dimensional constraint problem. We would make some simulation experiments to show the classification accuracy, running time, and used kernel of our model, compared with different models.
3. Theorem of MKLBP
Theorem 1. Not all the kernels are selected in the MKLBP model, and of the selected kernels are unique.
Proof. By fixing as , we could easily know that the optimizing result of in (6) would be irrelevant to . We use the Langrage function and getBy trying to get the partial derivatives of , we get thatBy setting , we get :Considering when in (9) is below zero, we set asFrom (10), we could easily find that when , we get . So not all kernels would be selected in the model when . Thus, our model successfully selects the useful kernels in optimization. Also, from (10), the optimization result of is unique in our model.
Specially, when , the algorithm is degenerated into the norm MKL, and we getWe find that all , which indicates that all kernels are selected in the norm MKL, so it would not discard useful kernels in the optimization. However, the model would not get high accuracy in prediction when faced with noisy data. Also in that scenario, the model may cause higher computational complexity.
Definition 2 (similar kernel). With the optimization of (4) and , if the selected kernels and correspond to the formula below, we call them similar kernels:
Theorem 3. Similar kernels would get the same kernel weights when approaches the limit.
Proof. We calculate as below:When approaches to the limit, . Theorem 3 indicates that when approaches the limit, among different kernels would be very small, and thus the classification accuracy does not change.
4. Solution of MKLBP
Although we have presented the MKLBP model, it is still hard to optimize problem (6). Problem (6) is quadratic programming with a high dimension constraint. In the GMKL algorithm, [11] used the level method to solve the problem. However, in our model, the constraint is dimensional and the method in [11] does not work. So, we resort to the Taylor expansion method to solve the problem approximately.
We use the coordinate decreasing method to solve the problem in the iteration; we fix or , then solve the subproblem, and finally update or .
Process 1. Update by fixing u. At the first time, is initialed as the approximate solution of ; (6) turns to a standard SVM problem below:
Number refers to the iteration time of algorithm. We employ the SMO algorithm to solve this standard problem.
Process 2. Update by fixing ; (6) turns to quadratic programming with a high dimensional constraint. Then use the Taylor expansion to decrease the dimension:By using the transformation in (15), the constraint turns toNow with the Taylor expansion, we successfully changed the high dimensional constraint to a quadratic constraint. Next, we use the level method and CVX toolbox as the GMKL to solve the problem in Process 2. CVX toolbox is a useful MATLAB toolbox in solving many mathematic problems.
Process 3. Update or until the stop criterion is satisfied. The stop criterion is that the program has reached the iteration time or the changes of the objective function have reached the threshold.
We could find that when , we successfully changed the problem to the GMKL, so the complexity is the same as that of GMKL. And according to [8], the complexity of GMKL is , when is the threshold of solution.
5. Experiments
In this section we use the UCI data to evaluate the classification accuracies in different algorithms.
We evaluate the following algorithm:
(1) AveKernel. We use a base combination of the kernels. The weights of base combination of kernels are . We use the standard SVM solver to solve the Avekernel.
(2) SimpleMKL. It is a traditional MKL model, which is a useful comparison algorithm in many papers.
(3)MKL. The constraint of the kernel weight is ; in our paper we set as MKL.
(4) GMKL. The constraint of kernel weights is , and in our paper, we set as the GMKL.
To be consistent with the past work, all the solvers of the SVM QP are from the LibSVM QP solver. For updating and solving kernel weights, we use the CVX toolbox.
For the SVM parameter , we set it as 100. For the MKLBP algorithm in our paper, the parameter settings are as below:
The setting of parameter is 2, 3, 4, 5, 6, 7, 8, 16, 32, 64. When , the algorithm is degenerated to the GMKL. The setting of the parameter is 0.5 as the MKLBP.
We will use the UCI database to analyze our MKLBP algorithm; the experiment used 5 UCI datasets. The format of the datasets is given in Table 1.

The setting of kernels is shown as below.
(1) Gaussian Kernel. . We use 10 parameters .
(2) Polynomial Kernel. . The parameters are .
The Gaussian kernel and polynomial kernel are the most popular kernels in SVM, combining them in the same model could combine their character in classification. We imitate the simpleMKL and GMKL algorithm, to normalize the kernel matrix to one unit and we construct 13 kernels ( represents the dimension of data, and the number 13 is the total number of Gaussian kernel and polynomial kernel). We randomly divided the data into two groups. One group with 50% is used for training, and the other group with 50% is for testing. We test the datasets for 50 times to get the same effects of the crossvalidation. For every UCI data we run the experiments for 5 times and count the average accuracy of the experiments.
The variation of leads to the accuracy of the algorithm: Table 2 shows that when , the accuracy of the MKLBP model increases in a small scale. Compared with the, accuracy increases by 1.21%, 1.81%, 1.11%, 2.27%, and 0.58%, respectively. However, from Figure 1 we found that as varies, the accuracy does not change in a large scale.

Compared with other GMKL accuracies, from Table 3 we found that when , the MKLBP model gets better classification accuracy. We discovered that besides the heart data, the MKLBP model shows the highest accuracy, and the GMKL model (the MKLBP model when ), simpleMKL model, and MKL model all have similar accuracy a little smaller than MKLBP, while Avekernel model reflects the smallest accuracy. The accuracy comparison of different algorithms is also shown in Figure 2.

Compared with other MKL models' running time, Table 4 demonstrates that the Avekernel model shows the highest speed, for it only needs to calculate the SVM problem. The running time of MKL model is a bit faster than the simpleMKL model and the GMKL model, and the simpleMKL model and the GMKL model show similar running time. However, the running time of MKLBP model is the longest. The reason is that by using the Taylor expansion to calculate , it needs slightly more time. So how to improve the running speed of our algorithm is a problem which needs to be solved in the future research. In order to compare the results clearly, Figure 3 shows the running time of different models.

The variation of number of selected kernel functions is shown in Table 5: the Avekernel model and MKL model select all the kernel functions, while simpleMKL model, GMKL model, and MKLBP model only select a portion of the kernels, which indicates that the MKLBP keeps the sparsity for the kernel selecting of MKL model and GMKL model. We discovered that MKLBP model and the GMKL model select more kernels than the simpleMKL. The reason is that the simpleMKL may discard some useful kernels while the MKLBP model retains these kernels similarly to the GMKL model. Figure 4 shows the comparison of the number of the kernels used in the different models.

We could find that when , the accuracy of the MKLBP model increases in a small scale. However, the accuracy of MKLBP is not linear to the . For example, the best classification of heart is . Therefore, when changes, the advantage of MKLBP is that we could get higher accuracy than GMKL, but the disadvantage of MKLBP is that we could not ensure the optimal for the model.
In summary, multiple kernels improve generalization and precision performance in all the experiments, and the running speed of our model is also very fast.
6. Conclusion
In our paper we presented a novel MKL model, MKLBP model, based on the norm. The model combines MKL model and MKL model, which generalizes the GMKL model with to our . The MKLBP model keeps the sparsity of MKL model and GMKL model, which only selects useful kernels and makes relatively higher classification accuracy when faced with the noisy data. We use the Taylor expansion to optimize the problem.
From the experiments we found, compared with other MKL models, our MKLBP model obtains a higher classification accuracy than other models and the kernels selected are much fewer than Avekernel model and MKL model. Nevertheless, how to increase classification speed of MKLBP model is still a problem which we need to solve in the future research.
In the future work, the convergence rates in the experiments may be improved with combining coordinate decreasing method [12].
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
Authors’ Contributions
Jinshan Qi and Xun Liang conceived and designed the experiments. Jinshan Qi and Rui Xu performed the experiments. Jinshan Qi and Xun Liang wrote the paper.
Acknowledgments
This work is supported by the National Natural Science Foundation of China (Grants nos. 71531012 and 71271211), the Natural Science Foundation of Beijing (Grant no. 4172032), the Fundamental Research Funds for the Central Universities (the Research Funds of Renmin University of China, Grant no. 10XNI029), and the Natural Science Foundation of Jiangsu Province of China (Grant no. BK20141253).
References
 C. Chang and C. Lin, “LIBSVM: a Library for support vector machines,” ACM Transactions on Intelligent Systems and Technology, vol. 2, no. 3, article 27, 2011. View at: Publisher Site  Google Scholar
 M. Kloft, U. Rückert, and P. L. Bartlett, “A unifying view of multiple kernel learning,” in Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML PKDD '10), pp. 66–81, Barcelona, Spain, September 2010. View at: Google Scholar
 C. A. Micchelli and M. Pontil, “Learning the kernel function via regularization,” Journal of Machine Learning Research (JMLR), vol. 6, pp. 1099–1125, 2005. View at: Google Scholar  MathSciNet
 Z. Xu, R. Jin, H. Yang, I. King, and M. R. Lyu, “Simple and efficient multiple kernel learning by group lasso,” in Proceedings of the 27th International Conference on International Conference on Machine Learning, pp. 1175–1182, Haifa, Israel, June 2010. View at: Google Scholar
 A. Rakotomamonjy, F. R. Bach, S. Canu, and Y. Grandvalet, “Simple MKL,” Journal of Machine Learning Research, vol. 9, pp. 2491–2521, 2008. View at: Google Scholar  MathSciNet
 Y. Han and J. Wang, “A bisparse relational learning algorithm based on multiple kernel learning,” Jisuanji Yanjiu yu Fazhan/Computer Research and Development, vol. 47, no. 8, pp. 1400–1406, 2010. View at: Google Scholar
 M. Hu, Y. Chen, and J. T.Y. Kwok, “Building sparse multiplekernel SVM classifiers,” IEEE Transactions on Neural Networks and Learning Systems, vol. 20, no. 5, pp. 827–839, 2009. View at: Publisher Site  Google Scholar
 H. Yang, Z. Xu, J. Ye, I. King, and M. R. Lyu, “Efficient sparse generalized multiple kernel learning,” IEEE Transactions on Neural Networks and Learning Systems, vol. 22, no. 3, pp. 433–446, 2011. View at: Publisher Site  Google Scholar
 X. Xu, I. W. Tsang, and D. Xu, “Soft margin multiple kernel learning,” IEEE Transactions on Neural Networks and Learning Systems, vol. 24, no. 5, pp. 749–761, 2013. View at: Publisher Site  Google Scholar
 M. Kloft, U. Brefeld, S. Sonnenburg, and A. Zien, “norm multiple kernel learning,” Journal of Machine Learning Research, vol. 12, pp. 953–997, 2011. View at: Google Scholar  MathSciNet
 B. E. Boser, I. M. Guyon, and V. N. Vapnik, “A training algorithm for optimal margin classifiers,” in Proceedings of the 5th Annual Workshop on Computational Learning Theory (COLT '92), pp. 144–152, ACM Press, 1992. View at: Publisher Site  Google Scholar
 S. Sheen, “On the convergence of the coordinate decreasing method for convex differentiable minimizations,” Journal of Optimization Theory and Applications, vol. 72, no. 1, 1992. View at: Google Scholar
Copyright
Copyright © 2018 Jinshan Qi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.