z-logo
open-access-imgOpen Access
Group-based local adaptive deep multiple kernel learning with lp norm
Author(s) -
Shengbing Ren,
Liu Fa,
Weijia Zhou,
Xian Wang Feng,
Chaudry Naeem Siddique
Publication year - 2020
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0238535
Subject(s) - multiple kernel learning , kernel (algebra) , artificial intelligence , variable kernel density estimation , kernel embedding of distributions , radial basis function kernel , computer science , kernel method , tree kernel , cluster analysis , pattern recognition (psychology) , machine learning , polynomial kernel , norm (philosophy) , mathematics , support vector machine , combinatorics , political science , law
The deep multiple kernel Learning (DMKL) method has attracted wide attention due to its better classification performance than shallow multiple kernel learning. However, the existing DMKL methods are hard to find suitable global model parameters to improve classification accuracy in numerous datasets and do not take into account inter-class correlation and intra-class diversity. In this paper, we present a group-based local adaptive deep multiple kernel learning (GLDMKL) method with lp norm. Our GLDMKL method can divide samples into multiple groups according to the multiple kernel k-means clustering algorithm. The learning process in each well-grouped local space is exactly adaptive deep multiple kernel learning. And our structure is adaptive, so there is no fixed number of layers. The learning model in each group is trained independently, so the number of layers of the learning model maybe different. In each local space, adapting the model by optimizing the SVM model parameter α and the local kernel weight β in turn and changing the proportion of the base kernel of the combined kernel in each layer by the local kernel weight, and the local kernel weight is constrained by the lp norm to avoid the sparsity of basic kernel. The hyperparameters of the kernel are optimized by the grid search method. Experiments on UCI and Caltech 256 datasets demonstrate that the proposed method is more accurate in classification accuracy than other deep multiple kernel learning methods, especially for datasets with relatively complex data.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here