Sciweavers

99 search results - page 17 / 20
» Learning the kernel via convex optimization
Sort
View
NIPS
2001
13 years 9 months ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
CVPR
2008
IEEE
14 years 9 months ago
Interactive image segmentation via minimization of quadratic energies on directed graphs
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
Dheeraj Singaraju, Leo Grady, René Vidal
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
13 years 9 months ago
Learning incoherent sparse and low-rank patterns from multiple tasks
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
Jianhui Chen, Ji Liu, Jieping Ye
JMLR
2010
103views more  JMLR 2010»
13 years 2 months ago
Learning Nonlinear Dynamic Models from Non-sequenced Data
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
Tzu-Kuo Huang, Le Song, Jeff Schneider
MM
2010
ACM
137views Multimedia» more  MM 2010»
13 years 8 months ago
Unsupervised summarization of rushes videos
This paper proposes a new framework to formulate the problem of rushes video summarization as an unsupervised learning problem. We pose the problem of video summarization as one o...
Yang Liu, Feng Zhou, Wei Liu, Fernando De la Torre...