ﻻ يوجد ملخص باللغة العربية
Two algorithms proposed by Leo Breiman : CART trees (Classification And Regression Trees for) introduced in the first half of the 80s and random forests emerged, meanwhile, in the early 2000s, are the subject of this article. The goal is to provide each of the topics, a presentation, a theoretical guarantee, an example and some variants and extensions. After a preamble, introduction recalls objectives of classification and regression problems before retracing some predecessors of the Random Forests. Then, a section is devoted to CART trees then random forests are presented. Then, a variable selection procedure based on permutation variable importance is proposed. Finally the adaptation of random forests to the Big Data context is sketched.
The goal of this Habilitation `a diriger des recherches is to present two different applications, namely computations of certain partition functions in probability and applications to integrable systems, of the topological recursion developed by B. E
We describe the behaviour of the rank of the Mordell-Weil group of the Picard variety of the generic fibre of a fibration in terms of local contributions given by averaging traces of Frobenius acting on the fibres. The results give a reinterpretation
Nous montrons que les equations du rep`ere mobile des surfaces de Bonnet conduisent `a une paire de Lax matricielle isomonodromique dordre deux pour la sixi`eme equation de Painleve. We show that the moving frame equations of Bonnet surfaces can be
In this article, we propose new Bayesian methods for selecting and estimating a sparse coefficient vector for skewed heteroscedastic response. Our novel Bayesian procedures effectively estimate the median and other quantile functions, accommodate non
This is the memoir of my habilitation thesis, defended on March 29 th, 2013 (Universite Paris XI).