Sciweavers

683 search results - page 29 / 137
» Generalization Bounds for Learning Kernels
Sort
View
NIPS
2001
13 years 9 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
TCS
2008
13 years 8 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
ICML
2004
IEEE
14 years 9 months ago
K-means clustering via principal component analysis
Principal component analysis (PCA) is a widely used statistical technique for unsupervised dimension reduction. K-means clustering is a commonly used data clustering for unsupervi...
Chris H. Q. Ding, Xiaofeng He
FOCM
2008
140views more  FOCM 2008»
13 years 8 months ago
Online Gradient Descent Learning Algorithms
This paper considers the least-square online gradient descent algorithm in a reproducing kernel Hilbert space (RKHS) without explicit regularization. We present a novel capacity i...
Yiming Ying, Massimiliano Pontil
JMLR
2008
95views more  JMLR 2008»
13 years 8 months ago
Learning Similarity with Operator-valued Large-margin Classifiers
A method is introduced to learn and represent similarity with linear operators in kernel induced Hilbert spaces. Transferring error bounds for vector valued large-margin classifie...
Andreas Maurer