Comparer des méthodes

	Algorithme de jet anti-kT	Identification de Particules par Arbres de Décision Boostés (BDT)
Domaine	Physique des particules	Physique des particules
Famille	Process / pipeline	Process / pipeline
Année d'origine	2008	2000
Auteur d'origine	Matteo Cacciari and Gavin P. Salam	Machine learning / particle physics community
Type	Particle clustering algorithm	Particle discrimination algorithm
Source fondatrice	Cacciari, M., Salam, G. P., & Sapeta, S. (2008). On the characterisation of the underlying event. Journal of High Energy Physics, 2008(04), 063.	Breiman, L. (2001). Random Forests. Machine Learning, 45(1), 5–32.
Alias	anti-kt clustering, anti-kT algorithm	BDT classifier, MVA particle ID, multivariate particle identification
Apparentées	3	3
Résumé	The anti-kT jet algorithm, introduced by Cacciari and Salam in 2008, is a sequential recombination jet clustering algorithm widely used in high-energy physics to group final-state particles into jets. Unlike earlier algorithms, anti-kT produces jets with regular cone-like geometries in transverse momentum-rapidity space, making it ideal for precision measurements and new physics searches.	Boosted Decision Trees (BDTs) are powerful multivariate classifiers used in particle physics to distinguish between different particle types based on detector signatures. By combining many weak decision trees through adaptive boosting, BDTs achieve superior discrimination power compared to simple cuts, enabling improved purity and efficiency in particle identification and background rejection.