Sciweavers

1055 search results - page 83 / 211
» Convex Factorization Machines
Sort
View
109
Voted
IJCNN
2006
IEEE
15 years 6 months ago
Leave-One-Out Cross-Validation Based Model Selection Criteria for Weighted LS-SVMs
Abstract— While the model parameters of many kernel learning methods are given by the solution of a convex optimisation problem, the selection of good values for the kernel and r...
Gavin C. Cawley
99
Voted
COLT
2004
Springer
15 years 6 months ago
Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results
One of the nice properties of kernel classifiers such as SVMs is that they often produce sparse solutions. However, the decision functions of these classifiers cannot always be u...
Peter L. Bartlett, Ambuj Tewari
ICALP
2001
Springer
15 years 5 months ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
Gerhard J. Woeginger
123
Voted
NIPS
2004
15 years 2 months ago
Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
Xiaojin Zhu, Jaz S. Kandola, Zoubin Ghahramani, Jo...
131
Voted
UAI
2004
15 years 2 months ago
The Minimum Information Principle for Discriminative Learning
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
Amir Globerson, Naftali Tishby