Confronta i metodi
Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.
| Algoritmo anti-kT per jet× | Identificazione di Particelle con BDT× | |
|---|---|---|
| Campo | Fisica delle particelle | Fisica delle particelle |
| Famiglia | Process / pipeline | Process / pipeline |
| Anno di origine≠ | 2008 | 2000 |
| Ideatore≠ | Matteo Cacciari and Gavin P. Salam | Machine learning / particle physics community |
| Tipo≠ | Particle clustering algorithm | Particle discrimination algorithm |
| Fonte seminale≠ | Cacciari, M., Salam, G. P., & Sapeta, S. (2008). On the characterisation of the underlying event. Journal of High Energy Physics, 2008(04), 063. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45(1), 5–32. DOI ↗ |
| Alias≠ | anti-kt clustering, anti-kT algorithm | BDT classifier, MVA particle ID, multivariate particle identification |
| Correlati | 3 | 3 |
| Sintesi≠ | 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. |
| ScholarGateInsieme di dati ↗ |
|
|