Sciweavers

136 search results - page 14 / 28
» A Reformulation of Support Vector Machines for General Confi...
Sort
View
COLT
2001
Springer
14 years 7 hour ago
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
Peter L. Bartlett, Shahar Mendelson
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
14 years 8 months ago
Regularized multi--task learning
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks...
Theodoros Evgeniou, Massimiliano Pontil
NIPS
2003
13 years 8 months ago
Laplace Propagation
We present a novel method for approximate inference in Bayesian models and regularized risk functionals. It is based on the propagation of mean and variance derived from the Lapla...
Alexander J. Smola, Vishy Vishwanathan, Eleazar Es...
DATAMINE
2006
157views more  DATAMINE 2006»
13 years 7 months ago
Data Clustering with Partial Supervision
Clustering with partial supervision finds its application in situations where data is neither entirely nor accurately labeled. This paper discusses a semisupervised clustering algo...
Abdelhamid Bouchachia, Witold Pedrycz
PR
2006
152views more  PR 2006»
13 years 7 months ago
Edit distance-based kernel functions for structural pattern classification
A common approach in structural pattern classification is to define a dissimilarity measure on patterns and apply a distance-based nearest-neighbor classifier. In this paper, we i...
Michel Neuhaus, Horst Bunke