Multiple kernel learning

About: Multiple kernel learning is a research topic. Over the lifetime, 1630 publications have been published within this topic receiving 56082 citations.

Multiple Kernel Learning with High Order Kernels

Abstract: Previous Multiple Kernel Learning approaches (MKL) employ different kernels by their linear combination. Though some improvements have been achieved over methods using single kernel, the advantages of employing multiple kernels for machine learning are far from being fully developed. In this paper, we propose to use “high order kernels” to enhance the learning of MKL when a set of original kernels are given. High order kernels are generated by the products of real power of the original kernels. We incorporate the original kernels and high order kernels into a unified localized kernel logistic regression model. To avoid over-fitting, we apply group LASSO regularization to the kernel coefficients of each training sample. Experiments on image classification prove that our approach outperforms many of the existing MKL approaches.

Kernel spectral clustering for dynamic data using multiple kernel learning

Abstract: In this paper we propose a kernel spectral clustering-based technique to catch the different regimes experienced by a time-varying system. Our method is based on a multiple kernel learning approach, which is a linear combination of kernels. The calculation of the linear combination coefficients is done by determining a ranking vector that quantifies the overall dynamical behavior of the analyzed data sequence over-time. This vector can be calculated from the eigenvectors provided by the the solution of the kernel spectral clustering problem. We apply the proposed technique to a trial from the Graphics Lab Motion Capture Database from Carnegie Mellon University, as well as to a synthetic example, namely three moving Gaussian clouds. For comparison purposes, some conventional spectral clustering techniques are also considered, namely, kernel k-means and min-cuts. Also, standard k-means. The normalized mutual information and adjusted random index metrics are used to quantify the clustering performance. Results show the usefulness of proposed technique to track dynamic data, even being able to detect hidden objects.

Learning Combinations of Multiple Feature Representations for Music Emotion Prediction

Abstract: Music consists of several structures and patterns evolving through time which greatly influences the human decoding of higher-level cognitive aspects of music like the emotions expressed in music. For tasks, such as genre, tag and emotion recognition, these structures have often been identified and used as individual and non-temporal features and representations. In this work, we address the hypothesis whether using multiple temporal and non-temporal representations of different features is beneficial for modeling music structure with the aim to predict the emotions expressed in music. We test this hypothesis by representing temporal and non-temporal structures using generative models of multiple audio features. The representations are used in a discriminative setting via the Product Probability Kernel and the Gaussian Process model enabling Multiple Kernel Learning, finding optimized combinations of both features and temporal/ non-temporal representations. We show the increased predictive performance using the combination of different features and representations along with the great interpretive prospects of this approach.