Thomas Keck
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Thomas Keck has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
Anze Zupanc
Jožef Stefan Institute Ljubljana Slovenia
2 shared publicationsChristian Pulvermacher
Karlsruhe Institute of Technology Karlsruhe Germany
2 shared publicationsFelix Metzner
Karlsruhe Institute of Technology Karlsruhe Germany
2 shared publicationsJochen Gemmler
Karlsruhe Institute of Technology Karlsruhe Germany
2 shared publications- Markus Tobias Prim
Universität Bonn, Regina-Pacis-Weg 3, D-53113 Bonn, Germany
2 shared publications Martin Ritter
Ludwig Maximilians Universität Munich Germany
2 shared publications
Latest Publications
- Open Access
The Full Event Interpretation -- An exclusive tagging algorithm for the Belle II experiment
The Full Event Interpretation is presented: a new exclusive tagging algorithm used by the high-energy physics experiment Belle II. The experimental setup of Belle II allows the precise measurement of otherwise inaccessible $B$ meson decay-modes. The Full Event Interpretation algorithm enables many of these measurements. The algorithm relies on machine learning to automatically identify plausible $B$ meson decay chains based on the data recorded by the detector. Compared to similar algorithms employed by previous experiments, the Full Event Interpretation provides a greater efficiency, yielding a larger effective sample size usable in the measurement.Open AccessThe Full Event Interpretation -- An exclusive tagging algorithm for the Belle II experiment
The Full Event Interpretation is presented: a new exclusive tagging algorithm used by the high-energy physics experiment Belle II. The experimental setup of Belle II allows the precise measurement of otherwise inaccessible $B$ meson decay-modes. The Full Event Interpretation algorithm enables many of these measurements. The algorithm relies on machine learning to automatically identify plausible $B$ meson decay chains based on the data recorded by the detector. Compared to similar algorithms employed by previous experiments, the Full Event Interpretation provides a greater efficiency, yielding a larger effective sample size usable in the measurement. - Open Access
- 25 February 2019
- Published by Springer Nature in Computing and Software for Big Science
- Vol. 3 (1) , 1-10
The Full Event Interpretation
- 25 February 2019
- Published by Springer Nature in Computing and Software for Big Science
- Vol. 3 (1) , 1-10
Open AccessThe Full Event Interpretation
- 8 November 2018
- Published by Springer Nature in Computing and Software for Big Science
- Vol. 2 (1) , 9
B2BII: Data Conversion from Belle to Belle II
- 8 November 2018
- Published by Springer Nature in Computing and Software for Big Science
- Vol. 2 (1) , 9
B2BII: Data Conversion from Belle to Belle II
- Open Access
- 29 September 2017
- Published by Springer Nature in Computing and Software for Big Science
- Vol. 1 (1) , 1-11
FastBDT: A Speed-Optimized Multivariate Classification Algorithm for the Belle II Experiment
- 29 September 2017
- Published by Springer Nature in Computing and Software for Big Science
- Vol. 1 (1) , 1-11
Open AccessFastBDT: A Speed-Optimized Multivariate Classification Algorithm for the Belle II Experiment
- Open Access
FastBDT: A speed-optimized and cache-friendly implementation of stochastic gradient-boosted decision trees for multivariate classification
Stochastic gradient-boosted decision trees are widely employed for multivariate classification and regression tasks. This paper presents a speed-optimized and cache-friendly implementation for multivariate classification called FastBDT. FastBDT is one order of magnitude faster during the fitting-phase and application-phase, in comparison with popular implementations in software frameworks like TMVA, scikit-learn and XGBoost. The concepts used to optimize the execution time and performance studies are discussed in detail in this paper. The key ideas include: An equal-frequency binning on the input data, which allows replacing expensive floating-point with integer operations, while at the same time increasing the quality of the classification; a cache-friendly linear access pattern to the input data, in contrast to usual implementations, which exhibit a random access pattern. FastBDT provides interfaces to C/C++, Python and TMVA. It is extensively used in the field of high energy physics by the Belle II experiment.
Open AccessFastBDT: A speed-optimized and cache-friendly implementation of stochastic gradient-boosted decision trees for multivariate classification
Stochastic gradient-boosted decision trees are widely employed for multivariate classification and regression tasks. This paper presents a speed-optimized and cache-friendly implementation for multivariate classification called FastBDT. FastBDT is one order of magnitude faster during the fitting-phase and application-phase, in comparison with popular implementations in software frameworks like TMVA, scikit-learn and XGBoost. The concepts used to optimize the execution time and performance studies are discussed in detail in this paper. The key ideas include: An equal-frequency binning on the input data, which allows replacing expensive floating-point with integer operations, while at the same time increasing the quality of the classification; a cache-friendly linear access pattern to the input data, in contrast to usual implementations, which exhibit a random access pattern. FastBDT provides interfaces to C/C++, Python and TMVA. It is extensively used in the field of high energy physics by the Belle II experiment.