Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Feynman-diagram× | BDT Partikelidentifiering× | |
|---|---|---|
| Ämnesområde | Partikelfysik | Partikelfysik |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1949 | 2000 |
| Upphovsperson≠ | Richard Feynman | Machine learning / particle physics community |
| Typ≠ | Visualization and calculation framework | Particle discrimination algorithm |
| Ursprungskälla≠ | 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 ↗ |
| Alias≠ | Feynman graph, interaction diagram | BDT classifier, MVA particle ID, multivariate particle identification |
| Närliggande | 3 | 3 |
| Sammanfattning≠ | 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. |
| ScholarGateDatamängd ↗ |
|
|