scispace - formally typeset
Search or ask a question
Topic

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.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, the authors proposed a multimodal machine learning framework that combines the Boruta based feature selection and multiple kernel learning (MKL) to integrate the multim-modal features of structural and functional MRIs and diffusion tensor images (DTI) for the diagnosis of early adolescent ADHD.
Abstract: Attention-deficit/hyperactivity disorder (ADHD) is one of the most common brain diseases among children. The current criteria of ADHD diagnosis mainly depend on behavior analysis, which is subjective and inconsistent, especially for children. The development of neuroimaging technologies, such as magnetic resonance imaging (MRI), drives the discovery of brain abnormalities in structure and function by analyzing multimodal neuroimages for computer-aided diagnosis of brain diseases. This paper proposes a multimodal machine learning framework that combines the Boruta based feature selection and Multiple Kernel Learning (MKL) to integrate the multimodal features of structural and functional MRIs and Diffusion Tensor Images (DTI) for the diagnosis of early adolescent ADHD. The rich and complementary information of the macrostructural features, microstructural properties, and functional connectivities are integrated at the kernel level, followed by a support vector machine classifier for discriminating ADHD from healthy children. Our experiments were conducted on the comorbidity-free ADHD subjects and covariable-matched healthy children aged 9-10 chosen from the Adolescent Brain and Cognitive Development (ABCD) study. This paper is the first work to combine structural and functional MRIs with DTI for early adolescents of the ABCD study. The results indicate that the kernel-level fusion of multimodal features achieves 0.698 of AUC (area under the receiver operating characteristic curves) and 64.3% of classification accuracy for ADHD diagnosis, showing a significant improvement over the early feature fusion and unimodal features. The abnormal functional connectivity predictors, involving default mode network, attention network, auditory network, and sensorimotor mouth network, thalamus, and cerebellum, as well as the anatomical regions in basal ganglia, are found to encode the most discriminative information, which collaborates with macrostructure and diffusion alterations to boost the performances of disorder diagnosis.

11 citations

Proceedings ArticleDOI
11 Dec 2011
TL;DR: This paper proposes a novel framework for recognizing complex opinion attributes from product reviews by focusing on linguistic properties of text fragments' similarities which are obtained from multiple sources of lexical and semantic information.
Abstract: In this paper we propose a novel framework for recognizing complex opinion attributes from product reviews. Instead of focusing on linguistic properties of text fragments and their direct representations, we focus on these fragments' similarities which we obtain from multiple sources of lexical and semantic information. The problem is formulated as that of multiclass classification and is based on multiple similarity matrices. We apply multiple kernel learning algorithm which seeks optimal combinations of matrices using linear programming and support vector machines for classification. Experiments demonstrate benefits from multiple sources of information. Overall, the approach is promising especially in the case of reviews of product types with complex and wordy attribute expressions.

11 citations

Journal ArticleDOI
24 Aug 2012-PLOS ONE
TL;DR: A recently developed non-sparse MKL variant is applied to state-of-the-art concept recognition tasks from the application domain of computer vision and compared against its direct competitors, the sum-kernel SVM and sparse MKL.
Abstract: Combining information from various image features has become a standard technique in concept recognition tasks. However, the optimal way of fusing the resulting kernel functions is usually unknown in practical applications. Multiple kernel learning (MKL) techniques allow to determine an optimal linear combination of such similarity matrices. Classical approaches to MKL promote sparse mixtures. Unfortunately, 1-norm regularized MKL variants are often observed to be outperformed by an unweighted sum kernel. The main contributions of this paper are the following: we apply a recently developed non-sparse MKL variant to state-of-the-art concept recognition tasks from the application domain of computer vision. We provide insights on benefits and limits of non-sparse MKL and compare it against its direct competitors, the sum-kernel SVM and sparse MKL. We report empirical results for the PASCAL VOC 2009 Classification and ImageCLEF2010 Photo Annotation challenge data sets. Data sets (kernel matrices) as well as further information are available at http://doc.ml.tu-berlin.de/image_mkl/(Accessed 2012 Jun 25).

11 citations

Proceedings ArticleDOI
16 Jun 2012
TL;DR: This work shows that using multiple kernel based classification, where the kernels are carefully selected for the different features, significantly increases the classification accuracy and demonstrates that by using linear support vector machine with explicit feature maps of the selected kernels one can achieve comparable results to the (non-linear) kernel based one.
Abstract: Modality is a key facet in medical image retrieval, as a user is likely interested in only one of e.g. radiology images, flowcharts, and pathology photos. While assessing image modality is trivial for humans, reliable automatic methods are required to deal with large un-annotated image bases, such as figures taken from the millions of scientific publications. We present a multi-disciplinary approach to tackle the classification problem by combining image features, meta-data, textual and referential information. We test our system's accuracy on the ImageCLEF 2011 medical modality classification data set. We show that using multiple kernel based classification, where the kernels are carefully selected for the different features, significantly increases the classification accuracy. Moreover, we demonstrate that by using linear support vector machine with explicit feature maps [35] of the selected kernels one can achieve comparable results to the (non-linear) kernel based one. Our best method achieves 88.47% accuracy and outperforms the state of the art.

11 citations

Journal ArticleDOI
TL;DR: In this paper, a variable selection approach that is developed by connecting a kernel machine with the non-parametric regression model is proposed, which can automatically model unknown and complicated interactions and connect with several existing approaches including linear nonnegative garrote and multiple kernel learning.
Abstract: Summary Variable selection for recovering sparsity in nonadditive and nonparametric models with high-dimensional variables has been challenging. This problem becomes even more difficult due to complications in modeling unknown interaction terms among high-dimensional variables. There is currently no variable selection method to overcome these limitations. Hence, in this article we propose a variable selection approach that is developed by connecting a kernel machine with the nonparametric regression model. The advantages of our approach are that it can: (i) recover the sparsity; (ii) automatically model unknown and complicated interactions; (iii) connect with several existing approaches including linear nonnegative garrote and multiple kernel learning; and (iv) provide flexibility for both additive and nonadditive nonparametric models. Our approach can be viewed as a nonlinear version of a nonnegative garrote method. We model the smoothing function by a Least Squares Kernel Machine (LSKM) and construct the nonnegative garrote objective function as the function of the sparse scale parameters of kernel machine to recover sparsity of input variables whose relevances to the response are measured by the scale parameters. We also provide the asymptotic properties of our approach. We show that sparsistency is satisfied with consistent initial kernel function coefficients under certain conditions. An efficient coordinate descent/backfitting algorithm is developed. A resampling procedure for our variable selection methodology is also proposed to improve the power.

11 citations


Network Information
Related Topics (5)
Convolutional neural network
74.7K papers, 2M citations
89% related
Deep learning
79.8K papers, 2.1M citations
89% related
Feature extraction
111.8K papers, 2.1M citations
87% related
Feature (computer vision)
128.2K papers, 1.7M citations
87% related
Image segmentation
79.6K papers, 1.8M citations
86% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202321
202244
202172
2020101
2019113
2018114