Abstract. Smooth boosting algorithms are variants of boosting methods which handle only smooth distributions on the data. They are proved to be noise-tolerant and can be used in th...
When comparing discrete probability distributions, natural measures of similarity are not p distances but rather are informationdivergences such as Kullback-Leibler and Hellinger. ...
Multiple Instance Learning (MIL) is a special kind of supervised learning problem that has been studied actively in recent years. We propose an approach based on One-Class Support ...
The integration of diverse forms of informative data by learning an optimal combination of base kernels in classification or regression problems can provide enhanced performance w...
Observation activity, on instrumented collective learning situations, enables participants to appropriate themselves corresponding systems in their own practice. In this paper, we...