Comparison of the use of binary decision trees and neural networks in top-quark detection
- 1 March 1993
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review D
- Vol. 47 (5) , 1900-1905
- https://doi.org/10.1103/physrevd.47.1900
Abstract
The use of neural networks for signal versus background discrimination in high-energy physics experiments has been investigated and has compared favorably with the efficiency of traditional kinematic cuts. Recent work in top-quark identification produced a neural network that, for a given top-quark mass, yielded a higher signal-to-background ratio in Monte Carlo simulation than a corresponding set of conventional cuts. In this article we discuss another pattern-recognition algorithm, the binary decision tree. We apply a binary decision tree to top-quark identification at the Fermilab Tevatron and find it to be comparable in performance to the neural network. Furthermore, reservations about the ‘‘black box’’ nature of neural network discriminators do not appy to binary decision trees; a binary decision tree may be reduced to a set of kinematic cuts subject to conventional error analysis.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Snagging the top quark with a neural netPhysical Review D, 1992
- Search for top-quark decays to realWbosons at the Fermilab Tevatron colliderPhysical Review D, 1989
- The Lund Monte Carlo for hadronic processes — PYTHIA version 4.8Computer Physics Communications, 1987
- Parallel Distributed ProcessingPublished by MIT Press ,1986
- Multidimensional divide-and-conquerCommunications of the ACM, 1980