Sciweavers

990 search results - page 128 / 198
» Learning with non-positive kernels
Sort
View
ALT
2004
Springer
15 years 6 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
COLT
1999
Springer
15 years 2 months ago
Covering Numbers for Support Vector Machines
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
Ying Guo, Peter L. Bartlett, John Shawe-Taylor, Ro...
MM
2010
ACM
137views Multimedia» more  MM 2010»
14 years 10 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...
ICML
2009
IEEE
15 years 10 months ago
A simpler unified analysis of budget perceptrons
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
Ilya Sutskever
ICML
2008
IEEE
15 years 10 months ago
The skew spectrum of graphs
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
Risi Imre Kondor, Karsten M. Borgwardt