השוואת שיטות

	זיהוי חלקיקים באמצעות BDT	אלגוריתם הג'טים Anti-kT
תחום	פיזיקת חלקיקים	פיזיקת חלקיקים
משפחה	Process / pipeline	Process / pipeline
שנת המקור	2000	2008
הוגה השיטה	Machine learning / particle physics community	Matteo Cacciari and Gavin P. Salam
סוג	Particle discrimination algorithm	Particle clustering algorithm
מקור מכונן	Breiman, L. (2001). Random Forests. Machine Learning, 45(1), 5–32.	Cacciari, M., Salam, G. P., & Sapeta, S. (2008). On the characterisation of the underlying event. Journal of High Energy Physics, 2008(04), 063.
כינויים	BDT classifier, MVA particle ID, multivariate particle identification	anti-kt clustering, anti-kT algorithm
קשורות	3	3
תקציר	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.