Sciweavers

990 search results - page 86 / 198
» Evolving kernels for support vector machine classification
Sort
View
NIPS
2000
15 years 5 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
NIPS
2008
15 years 5 months ago
Relative Margin Machines
In classification problems, Support Vector Machines maximize the margin of separation between two classes. While the paradigm has been successful, the solution obtained by SVMs is...
Pannagadatta K. Shivaswamy, Tony Jebara
ICML
2006
IEEE
16 years 5 months ago
Nonstationary kernel combination
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
Darrin P. Lewis, Tony Jebara, William Stafford Nob...
IJCNN
2006
IEEE
15 years 10 months ago
Comparing Kernels for Predicting Protein Binding Sites from Amino Acid Sequence
— The ability to identify protein binding sites and to detect specific amino acid residues that contribute to the specificity and affinity of protein interactions has importan...
Feihong Wu
ESANN
2006
15 years 5 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...