Sciweavers

683 search results - page 8 / 137
» Generalization Bounds for Learning Kernels
Sort
View
ICML
2001
IEEE
14 years 8 months ago
General Loss Bounds for Universal Sequence Prediction
The Bayesian framework is ideally suited for induction problems. The probability of observing xt at
Marcus Hutter
KDD
2006
ACM
180views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning the unified kernel machines for classification
Kernel machines have been shown as the state-of-the-art learning techniques for classification. In this paper, we propose a novel general framework of learning the Unified Kernel ...
Steven C. H. Hoi, Michael R. Lyu, Edward Y. Chang
PAMI
2008
83views more  PAMI 2008»
13 years 7 months ago
Kernels for Generalized Multiple-Instance Learning
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
ILP
2007
Springer
14 years 1 months ago
A Phase Transition-Based Perspective on Multiple Instance Kernels
: This paper is concerned with relational Support Vector Machines, at the intersection of Support Vector Machines (SVM) and relational learning or Inductive Logic Programming (ILP)...
Romaric Gaudel, Michèle Sebag, Antoine Corn...
NIPS
2007
13 years 8 months ago
Random Features for Large-Scale Kernel Machines
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. The feat...
Ali Rahimi, Benjamin Recht