Sciweavers

979 search results - page 131 / 196
» Learning with Progressive Transductive Support Vector Machin...
Sort
View
NIPS
2007
15 years 4 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
117
Voted
ISMIR
2004
Springer
118views Music» more  ISMIR 2004»
15 years 8 months ago
Learning to Align Polyphonic Music
We describe an efficient learning algorithm for aligning a symbolic representation of a musical piece with its acoustic counterpart. Our method employs a supervised learning appr...
Shai Shalev-Shwartz, Joseph Keshet, Yoram Singer
132
Voted
NN
2008
Springer
201views Neural Networks» more  NN 2008»
15 years 2 months ago
Learning representations for object classification using multi-stage optimal component analysis
Learning data representations is a fundamental challenge in modeling neural processes and plays an important role in applications such as object recognition. In multi-stage Optima...
Yiming Wu, Xiuwen Liu, Washington Mio
JMLR
2010
121views more  JMLR 2010»
14 years 9 months ago
Sparse Semi-supervised Learning Using Conjugate Functions
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
Shiliang Sun, John Shawe-Taylor
DAGM
2004
Springer
15 years 8 months ago
Learning from Labeled and Unlabeled Data Using Random Walks
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
Dengyong Zhou, Bernhard Schölkopf