| Random subspace with trees for feature selection under memory constraints Antonio Sutera, Célia Châtel, Gilles Louppe, Louis Wehenkel, Pierre Geurts Benelearn 2016, 2016 | 3* | 2016 |
| Totally balanced dissimilarities F Brucker, P Préa, C Châtel Journal of Classification 37, 203-222, 2020 | 2 | 2020 |
| Sélection de variables à grande échelle à partir de forêtes aléatoires C Châtel Master’s thesis, École Centrale de Marseille/Université de Liège, 2015 | 2 | 2015 |
| Binary set systems and totally balanced hypergraphs C Châtel, F Brucker, P Préa Discrete Applied Mathematics 295, 120-133, 2021 | 1 | 2021 |
| Modeles de classification en classes empiétantes, cas des modeles arborés C Châtel Aix Marseille Université, 2018 | | 2018 |
| Binary Lattices. C Châtel, F Brucker, P Préa FCA4AI@ IJCAI, 93-104, 2018 | | 2018 |
| A characterization of closed under intersection binary hypergraphs by a sequence of trees C Châtel, F Brucker, P Préa Journées nationales GDR Informatique Mathématique, 2018 | | 2018 |
| Arbres de décision k-means C Châtel, F Brucker, P Prea ROADEF, 2017 | | 2017 |
| Random subspace with trees for feature selection under memory constraints C Châtel, G Louppe, P Geurts | | |
