Sciweavers

1326 search results - page 83 / 266
» Approximate Tree Kernels
Sort
View
JMLR
2008
110views more  JMLR 2008»
13 years 8 months ago
Cross-Validation Optimization for Large Scale Structured Classification Kernel Methods
We propose a highly efficient framework for penalized likelihood kernel methods applied to multiclass models with a large, structured set of classes. As opposed to many previous a...
Matthias W. Seeger
JMLR
2011
148views more  JMLR 2011»
13 years 3 months ago
Bayesian Generalized Kernel Mixed Models
We propose a fully Bayesian methodology for generalized kernel mixed models (GKMMs), which are extensions of generalized linear mixed models in the feature space induced by a repr...
Zhihua Zhang, Guang Dai, Michael I. Jordan
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
13 years 10 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
COLT
1999
Springer
14 years 1 months ago
Covering Numbers for Support Vector Machines
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
Ying Guo, Peter L. Bartlett, John Shawe-Taylor, Ro...