Large Scale Multiple Kernel Learning
MPG.PuRe (Max Planck Society)Published 1 December 2006Open access
Sören Sonnenburg, Gunnar Rätsch, Christin Schäfer, Bernhard Schölkopf
Citations1,212
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is shown that the proposed multiple kernel learning algorithm can be rewritten as a semi-infinite linear program that can be efficiently solved by recycling the standard SVM implementations, and generalize the formulation and the method to a larger class of problems, including regression and one-class classification.
Abstract
All in-text\treferences\tunderlined\tin\tblue\tare\tlinked\tto\tpublications\ton\tResearchGate, letting you\taccess\tand\tread\tthem\timmediately.
Keywords
Computer ScienceBiochemistry, Genetics and Molecular Biology
Machine LearningSupport-Vector Networks
33,035 Citations1995Corinna Cortes, Vladimir Vapnik
High generalization ability of support-vector networks utilizing polynomial input transformations is demonstrated and the performance of the support- vector network is compared to various classical learning algorithms that all took part in a benchmark study of Optical Character Recognition.
Cambridge University Press eBooksConvex Optimization
31,266 Citations2004Stephen Boyd, Lieven Vandenberghe
Lecture notes in computer scienceText categorization with Support Vector Machines: Learning with many relevant features
7,925 Citations1998Thorsten Joachims
SVMs achieve substantial improvements over the currently best performing methods and behave robustly over a variety of di-erent learning tasks, eliminating the need for manual parameter tuning.
The relationship between Precision-Recall and ROC curves
6,255 Citations2006Jesse Davis, Mark Goadrich
It is shown that a deep connection exists between ROC space and PR space, such that a curve dominates in R OC space if and only if it dominates in PR space.
Seminars in Nuclear MedicineBasic principles of ROC analysis
5,991 Citations1978Charles E. Metz
ROC analysis is shown to be related in a direct and natural way to cost/benefit analysis of diagnostic decision making and the concepts of "average diagnostic cost" and "average net benefit" are developed and used to identify the optimal compromise among various kinds of diagnostic error.
The MIT Press eBooksFast Training of Support Vector Machines Using Sequential Minimal Optimization
5,462 Citations1998John Platt
Technical reportsMaking Large-Scale SVM Learning Practical
4,317 Citations2006Thorsten Joachims
This chapter presents algorithmic and computational results developed for SVM light V 2.0, which make large-scale SVM training more practical and give guidelines for the application of SVMs to large domains.
Machine LearningChoosing Multiple Parameters for Support Vector Machines
2,182 Citations2002Olivier Chapelle, Vladimir Vapnik +2 more
The problem of automatically tuning multiple parameters for pattern recognition Support Vector Machines (SVMs) is considered by minimizing some estimates of the generalization error of SVMs using a gradient descent algorithm over the set of parameters.
Multiple kernel learning, conic duality, and the SMO algorithm
1,447 Citations2004Francis Bach, Gert Lanckriet +1 more
Experimental results are presented that show that the proposed novel dual formulation of the QCQP as a second-order cone programming problem is significantly more efficient than the general-purpose interior point methods available in current optimization toolboxes.
Communications of the ACMTrie memory
1,081 Citations1960Edward Fredkin
In this paper several paradigms of trie memory are described and compared with other memory paradigm, their advantages and disadvantages are examined in detail, and applications are discussed.
SIAM ReviewSemi-Infinite Programming: Theory, Methods, and Applications
1,005 Citations1993R. Hettich, K. O. Kortanek
This paper treats numerical methods based on either discretization or local reduction with the emphasis on the design of superlinearly convergent (SQP-type) methods.
THE SPECTRUM KERNEL: A STRING KERNEL FOR SVM PROTEIN CLASSIFICATION
944 Citations2001Christina S. Leslie, Eleazar Eskin +1 more
A new sequence-similarity kernel, the spectrum kernel, is introduced for use with support vector machines (SVMs) in a discriminative approach to the protein classification problem and performs well in comparison with state-of-the-art methods for homology detection.
BioinformaticsA statistical framework for genomic data fusion
678 Citations2004Gert Lanckriet, Tijl De Bie +3 more
This paper describes a computational framework for integrating and drawing inferences from a collection of genome-wide measurements represented via a kernel function, which defines generalized similarity relationships between pairs of entities, such as genes or proteins.
ROC Graphs: Notes and Practical Considerations for Data Mining Researchers
635 Citations2003Tom Fawcett
Lecture notes in computer scienceAn Introduction to Boosting and Leveraging
451 Citations2003Ron Meir, Gunnar Rätsch
An introduction to theoretical and practical aspects ofboosting and Ensemble learning is provided, providing a useful reference for researchers in the field of Boosting as well as for those seeking to enter this fascinating area of research.
Adaptive Scaling for Feature Selection in SVMs
161 Citations2002Yves Grandvalet, Stéphane Canu
The resulting algorithm compares favorably to state-of-the-art feature selection procedures and demonstrates its effectiveness on a demanding facial expression recognition problem.
Computer applications in the biosciencesRASE: recognition of alternatively spliced exons in C.elegans
144 Citations2005Gunnar Rätsch, Soeren Sonnenburg +1 more
A support vector machine (SVM) kernel well suited for the task of classifying sequences with motifs having positional preferences is designed, which combines the kernel with additional local sequence information, such as lengths of the exon and the flanking introns, and achieves a true positive rate.
Totally corrective boosting algorithms that maximize the margin
121 Citations2006Manfred K. Warmuth, Jun Liao +1 more
Using new techniques, this work proves the same iteration bounds for the totally corrective algorithms as for their corrective versions, and with adaptive γ, the algorithms provably maximizes the margin.
BMC BioinformaticsLearning Interpretable SVMs for Biological Sequence Classification
106 Citations2006Gunnar Rätsch, Sören Sonnenburg +1 more
Novel and efficient algorithms are proposed for solving the so-called Support Vector Multiple Kernel Learning problem and can be used to understand the obtained support vector decision function in order to extract biologically relevant knowledge about the sequence analysis problem at hand.
Journal of Machine Learning ResearchEfficient Margin Maximizing with Boosting
104 Citations2005Gunnar Rätsch, Manfred K. Warmuth
A new version of AdaBoost is introduced, called AdaBoost*ν, that explicitly maximizes the minimum margin of the examples up to a given precision and incorporates a current estimate of the achievable margin into its calculation of the linear coefficients of the base hypotheses.
Column-generation boosting methods for mixture of kernels
78 Citations2004Jinbo Bi, Tong Zhang +1 more
A boosting approach to classification and regression based on column generation using a mixture of kernels, which produces sparser solutions, and thus significantly reduces the testing time and is able to scale CG boosting to large datasets.
MARK
77 Citations2002Kristin P. Bennett, Michinari Momma +1 more
This work proposes the Multiple Additive Regression Kernels (MARK) algorithm, which considers a large (potentially infinite) library of kernel matrices formed by different kernel functions and parameters and investigates how MARK is applied to heterogeneous kernel ridge regression.
publish.UP (University of Potsdam)Robust Boosting via Convex Optimization
58 Citations2001Gunnar Rätsch
Lecture notes in computer scienceLearning Interpretable SVMs for Biological Sequence Classification
56 Citations2005Soeren Sonnenburg, Gunnar Rätsch +1 more
Machine LearningSparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
52 Citations2002Gunnar Rätsch, Ayhan Demiriz +1 more
There exists an optimal solution to the infinite hypothesis space problem consisting of a finite number of hypothesis, and two algorithms for solving the infinite and finite hypothesis problems are proposed.
Large scale genomic sequence SVM classifiers
48 Citations2005Sören Sonnenburg, Gunnar Rätsch +1 more
This work study two recently proposed and successfully used kernels, namely the Spectrum kernel and the Weighted Degree kernel, and suggests several extensions using Suffix Trees and modifications of an SMO-like SVM training algorithm in order to accelerate the training of the SVMs and their evaluation on test sequences.
The MIT Press eBooksInexact Matching String Kernels for Protein Classification
15 Citations2004Christina S. Leslie, Rui Kuang +1 more
This chapter contains sections titled: Introduction, Definitions of Feature Maps and String Kernels, Efficient Computation, Fast Prediction, Experiments, Conclusion.