Sciweavers

63 search results - page 8 / 13
» Learning low-rank kernel matrices
Sort
View
ICDM
2009
IEEE
174views Data Mining» more  ICDM 2009»
14 years 2 months ago
Non-sparse Multiple Kernel Learning for Fisher Discriminant Analysis
—We consider the problem of learning a linear combination of pre-specified kernel matrices in the Fisher discriminant analysis setting. Existing methods for such a task impose a...
Fei Yan, Josef Kittler, Krystian Mikolajczyk, Muha...
ICML
2005
IEEE
14 years 8 months ago
Predictive low-rank decomposition for kernel methods
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
Francis R. Bach, Michael I. Jordan
ICML
2009
IEEE
14 years 8 months ago
Multi-instance learning by treating instances as non-I.I.D. samples
Previous studies on multi-instance learning typically treated instances in the bags as independently and identically distributed. The instances in a bag, however, are rarely indep...
Zhi-Hua Zhou, Yu-Yin Sun, Yu-Feng Li
BMCBI
2008
164views more  BMCBI 2008»
13 years 7 months ago
Word correlation matrices for protein sequence analysis and remote homology detection
Background: Classification of protein sequences is a central problem in computational biology. Currently, among computational methods discriminative kernel-based approaches provid...
Thomas Lingner, Peter Meinicke
RECOMB
2005
Springer
14 years 8 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...