Sciweavers

30 search results - page 3 / 6
» Random Features for Large-Scale Kernel Machines
Sort
View
ICML
2004
IEEE
14 years 6 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu
ALT
2001
Springer
14 years 2 months ago
Learning of Boolean Functions Using Support Vector Machines
This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm ...
Ken Sadohara
TKDD
2008
113views more  TKDD 2008»
13 years 5 months ago
Privacy-preserving classification of vertically partitioned data via random kernels
We propose a novel privacy-preserving support vector machine (SVM) classifier for a data matrix A whose input feature columns are divided into groups belonging to different entiti...
Olvi L. Mangasarian, Edward W. Wild, Glenn Fung
ESANN
2006
13 years 7 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...
IJCNN
2007
IEEE
14 years 3 days ago
Generalised Kernel Machines
Abstract— The generalised linear model (GLM) is the standard approach in classical statistics for regression tasks where it is appropriate to measure the data misfit using a lik...
Gavin C. Cawley, Gareth J. Janacek, Nicola L. C. T...