The Inverse Bagging Algorithm: Anomaly Detection by Inverse Bootstrap Aggregating
暂无分享,去创建一个
For data sets populated by a very well modeled process and by another process of unknown probability density function (PDF), a desired feature when manipulating the fraction of the unknown process (either for enhancing it or suppressing it) consists in avoiding to modify the kinematic distributions of the well modeled one. A bootstrap technique is used to identify sub-samples rich in the well modeled process, and classify each event according to the frequency of it being part of such sub-samples. Comparisons with general MVA algorithms will be shown, as well as a study of the asymptotic properties of the method, making use of a public domain data set that models a typical search for new physics as performed at hadronic colliders such as the Large Hadron Collider (LHC).
[1] Robert Tibshirani,et al. The empirical distribution function and the plug-in principle , 1993 .
[2] N. Altman. An Introduction to Kernel and Nearest-Neighbor Nonparametric Regression , 1992 .
[3] M. Kenward,et al. An Introduction to the Bootstrap , 2007 .
[4] Taylor Francis Online,et al. The American statistician , 1947 .
[5] Pierre Baldi,et al. Parameterized neural networks for high-energy physics , 2016, The European Physical Journal C.