Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Диаграмма Фейнмана× | Идентификация частиц с помощью BDT× | |
|---|---|---|
| Область | Физика элементарных частиц | Физика элементарных частиц |
| Семейство | Process / pipeline | Process / pipeline |
| Год появления≠ | 1949 | 2000 |
| Автор метода≠ | Richard Feynman | Machine learning / particle physics community |
| Тип≠ | Visualization and calculation framework | Particle discrimination algorithm |
| Основополагающий источник≠ | Feynman, R. P. (1949). The Theory of Positrons. Physical Review, 76(6), 749–759. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45(1), 5–32. DOI ↗ |
| Другие названия≠ | Feynman graph, interaction diagram | BDT classifier, MVA particle ID, multivariate particle identification |
| Связанные | 3 | 3 |
| Сводка≠ | Feynman diagrams are graphical representations of particle interactions introduced by Richard Feynman in 1949. They provide an intuitive and systematic way to visualize and calculate amplitudes for quantum field theory processes, converting complex mathematical expressions into geometric pictures that reveal the underlying physics. | 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. |
| ScholarGateНабор данных ↗ |
|
|