Sciweavers

979 search results - page 52 / 196
» Learning with Progressive Transductive Support Vector Machin...
Sort
View
ICML
2009
IEEE
15 years 9 months ago
Fast evolutionary maximum margin clustering
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
Fabian Gieseke, Tapio Pahikkala, Oliver Kramer
NIPS
2000
15 years 3 months ago
From Margin to Sparsity
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
Thore Graepel, Ralf Herbrich, Robert C. Williamson
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
13 years 4 months ago
Rank-loss support instance machines for MIML instance annotation
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich
ICMLA
2010
15 years 12 days ago
Using Randomised Vectors in Transcription Factor Binding Site Predictions
Finding the location of binding sites in DNA is a difficult problem. Although the location of some binding sites have been experimentally identified, other parts of the genome may ...
Faisal Rezwan, Yi Sun, Neil Davey, Rod Adams, Alis...
JMLR
2006
124views more  JMLR 2006»
15 years 2 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...