Sciweavers

92 search results - page 18 / 19
» Explicit recursivity into reproducing kernel Hilbert spaces
Sort
View
NIPS
2004
13 years 6 months ago
Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
JMLR
2006
186views more  JMLR 2006»
13 years 5 months ago
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
Mikhail Belkin, Partha Niyogi, Vikas Sindhwani
ML
2010
ACM
185views Machine Learning» more  ML 2010»
13 years 14 hour ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
COMPGEOM
2011
ACM
12 years 8 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
TNN
2011
200views more  TNN 2011»
13 years 5 days ago
Domain Adaptation via Transfer Component Analysis
Domain adaptation solves a learning problem in a target domain by utilizing the training data in a different but related source domain. Intuitively, discovering a good feature rep...
Sinno Jialin Pan, Ivor W. Tsang, James T. Kwok, Qi...