scholarly journals Lepton identification in Belle II using observables from the electromagnetic calorimeter and precision trackers

2020 ◽  
Vol 245 ◽  
pp. 06023
Author(s):  
Marco Milesi ◽  
Justin Tan ◽  
Phillip Urquijo

We present a major overhaul to lepton identification for the Belle II experiment, based on a novel multi-variate classification algorithm. Boosted decision trees are trained combining measurements from the electromagnetic calorimeter (ECL) and the tracking system. The chosen observables are sensitive to the different physics that governs interactions of hadrons, electrons and muons with the calorimeter crystals. Dedicated classifiers are used in various detector regions and lepton momentum ranges. The tree output is eventually combined with classifiers that rely upon independent measurements from other sub-detectors. Using simulation, the performance of the new algorithm is compared against the method used for analysis of the 2018 Belle II data, namely a likelihood discriminator based on the ratio of energy measured in the ECL over the momentum measured by the trackers. In the low momentum region, we largely improve the lepton-pion separation power, decreasing misidentification probability by a factor of 10 for electrons, and 2 for muons at fixed identification efficiency.

2004 ◽  
Vol 32 (2) ◽  
pp. 97-113 ◽  
Author(s):  
Anke Neumann ◽  
Josiane Holstein ◽  
Jean-Roger Le Gall ◽  
Eric Lepage

2006 ◽  
Vol 3 (2) ◽  
pp. 57-72 ◽  
Author(s):  
Kristina Machova ◽  
Miroslav Puszta ◽  
Frantisek Barcak ◽  
Peter Bednar

In this paper we present an improvement of the precision of classification algorithm results. Two various approaches are known: bagging and boosting. This paper describes a set of experiments with bagging and boosting methods. Our use of these methods aims at classification algorithms generating decision trees. Results of performance tests focused on the use of the bagging and boosting methods in connection with binary decision trees are presented. The minimum number of decision trees, which enables an improvement of the classification performed by the bagging and boosting methods, was found. The tests were carried out using the Reuter?s 21578 collection of documents as well as documents from an Internet portal of TV broadcasting company Mark?za. The comparison of our results on testing the bagging and boosting algorithms is presented.


2020 ◽  
Author(s):  
Vincent Bremer ◽  
Philip I Chow ◽  
Burkhardt Funk ◽  
Frances P Thorndike ◽  
Lee M Ritterband

BACKGROUND User dropout is a widespread concern in the delivery and evaluation of digital (ie, web and mobile apps) health interventions. Researchers have yet to fully realize the potential of the large amount of data generated by these technology-based programs. Of particular interest is the ability to predict who will drop out of an intervention. This may be possible through the analysis of user journey data—self-reported as well as system-generated data—produced by the path (or journey) an individual takes to navigate through a digital health intervention. OBJECTIVE The purpose of this study is to provide a step-by-step process for the analysis of user journey data and eventually to predict dropout in the context of digital health interventions. The process is applied to data from an internet-based intervention for insomnia as a way to illustrate its use. The completion of the program is contingent upon completing 7 sequential cores, which include an initial tutorial core. Dropout is defined as not completing the seventh core. METHODS Steps of user journey analysis, including data transformation, feature engineering, and statistical model analysis and evaluation, are presented. Dropouts were predicted based on data from 151 participants from a fully automated web-based program (Sleep Healthy Using the Internet) that delivers cognitive behavioral therapy for insomnia. Logistic regression with L1 and L2 regularization, support vector machines, and boosted decision trees were used and evaluated based on their predictive performance. Relevant features from the data are reported that predict user dropout. RESULTS Accuracy of predicting dropout (area under the curve [AUC] values) varied depending on the program core and the machine learning technique. After model evaluation, boosted decision trees achieved AUC values ranging between 0.6 and 0.9. Additional handcrafted features, including time to complete certain steps of the intervention, time to get out of bed, and days since the last interaction with the system, contributed to the prediction performance. CONCLUSIONS The results support the feasibility and potential of analyzing user journey data to predict dropout. Theory-driven handcrafted features increased the prediction performance. The ability to predict dropout at an individual level could be used to enhance decision making for researchers and clinicians as well as inform dynamic intervention regimens.


2021 ◽  
Author(s):  
HanEol Cho ◽  
Cheolhun Kim ◽  
Yuji Unno ◽  
ByungGu Cheon

2020 ◽  
Vol 15 (10) ◽  
pp. P10009-P10009
Author(s):  
D. Boumediene ◽  
A. Pingault ◽  
M. Tytgat ◽  
B. Bilki ◽  
D. Northacker ◽  
...  

2020 ◽  
Vol 15 (05) ◽  
pp. P05026-P05026 ◽  
Author(s):  
S. Summers ◽  
G. Di Guglielmo ◽  
J. Duarte ◽  
P. Harris ◽  
D. Hoang ◽  
...  

2020 ◽  
Vol 67 (9) ◽  
pp. 2143-2147
Author(s):  
I. S. Lee ◽  
S. H. Kim ◽  
C. H. Kim ◽  
H. E. Cho ◽  
Y. J. Kim ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document