J4 ›› 2016, Vol. 43 ›› Issue (1): 36-40.doi: 10.3969/j.issn.1001-2400.2016.01.007

• Original Articles • Previous Articles     Next Articles

Fast randommultiple kernel learning for classification

SUN Tao;FENG Jie   

  1. (Ministry of Education Key Lab. of Intelligent Perception and Image Understanding, Xidian Univ., Xi'an  710071, China)
  • Received:2014-08-31 Online:2016-02-20 Published:2016-04-06
  • Contact: SUN Tao E-mail:taosun@mail.xidian.edu.cn

Abstract:

Multiple kernel learning (MKL) combines multiple kernels in a convex optimization framework and seeks the best line combination of them. Generally, MKL can get better results than single kernel learning, but heavy computational burden makes MKL impractical. Inspired by the extreme learning machine (ELM), a novel fast MKL method based on the random kernel is proposed. When the framework of ELM is satisfied, the kernel parameters can be given randomly, which produces the random kernel. Thus, the sub-kernel scale is reduced largely, which accelerates the training time and saves the memory. Furthermore, the reduced kernel scale can reduce the error bound of MKL by analyzing the empirical Rademacher complexity of MKL. It gives a theoretical guarantee that the proposed method gets a higher classification accuracy than traditional MKL methods. Experiments indicate that the proposed method uses a faster speed, more small memory and gets better results than several classical fast MKL methods.

Key words: multiple kernel learning, extreme learning machine, random kernel, empirical rademacher complexity

CLC Number: 

  • TP775