Sciweavers

1037 search results - page 34 / 208
» Learning of Boolean Functions Using Support Vector Machines
Sort
View
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
14 years 8 months ago
Regularized multi--task learning
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks...
Theodoros Evgeniou, Massimiliano Pontil
ICML
2005
IEEE
14 years 8 months ago
The cross entropy method for classification
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term ...
Shie Mannor, Dori Peleg, Reuven Y. Rubinstein
COLT
2008
Springer
13 years 9 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
KDD
2006
ACM
181views Data Mining» more  KDD 2006»
14 years 8 months ago
Cryptographically private support vector machines
We study the problem of private classification using kernel methods. More specifically, we propose private protocols implementing the Kernel Adatron and Kernel Perceptron learning ...
Helger Lipmaa, Sven Laur, Taneli Mielikäinen
SIGKDD
2000
139views more  SIGKDD 2000»
13 years 7 months ago
Support Vector Machines: Hype or Hallelujah?
Support Vector Machines (SVMs) and related kernel methods have become increasingly popular tools for data mining tasks such as classification, regression, and novelty detection. T...
Kristin P. Bennett, Colin Campbell