3556 search results - page 268 / 712 » Can machine learning be secure |
154
click to vote
COLT
2001
Springer
15 years 10 months ago
2001
Springer
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...
146
click to vote
ICML
1995
IEEE
15 years 9 months ago
1995
IEEE
Systems that learn from examples often create a disjunctive concept definition. Small disjuncts are those disjuncts which cover only a few training examples. The problem with sma...
179
click to vote
ALT
2010
Springer
15 years 5 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
180
click to vote
ML
2006
ACM
15 years 5 months ago
2006
ACM
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
129
click to vote
ICML
2006
IEEE
16 years 6 months ago
2006
IEEE
We extend Support Vector Machines to input spaces that are sets by ensuring that the classifier is invariant to permutations of subelements within each input. Such permutations in...