Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Identification de Particules par Arbres de Décision Boostés (BDT)× | Algorithme de jet anti-kT× | |
|---|---|---|
| Domaine | Physique des particules | Physique des particules |
| Famille | Process / pipeline | Process / pipeline |
| Année d'origine≠ | 2000 | 2008 |
| Auteur d'origine≠ | Machine learning / particle physics community | Matteo Cacciari and Gavin P. Salam |
| Type≠ | Particle discrimination algorithm | Particle clustering algorithm |
| Source fondatrice≠ | Breiman, L. (2001). Random Forests. Machine Learning, 45(1), 5–32. DOI ↗ | Cacciari, M., Salam, G. P., & Sapeta, S. (2008). On the characterisation of the underlying event. Journal of High Energy Physics, 2008(04), 063. link ↗ |
| Alias≠ | BDT classifier, MVA particle ID, multivariate particle identification | anti-kt clustering, anti-kT algorithm |
| Apparentées | 3 | 3 |
| Résumé≠ | 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. | 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. |
| ScholarGateJeu de données ↗ |
|
|