用Binless和Binfull算法解决直方图分箱难题
Resolving Histogram Binning Dilemmas with Binless and Binfull Algorithms
摘要:
直方图是一种在许多科学中广泛使用的分析工具,高能物理就是一个很好的例子。然而,在直方图的分箱选择中存在固有的偏差,不同的选择可能导致不同的解释。本文的目的是消除这种偏见,使用两个“去箱”算法。这两种算法都从数据中生成一个观察到的累积分布函数,并使用它来构建底层概率分布函数的表示。比较了这两种算法的优缺点。最后对这些算法的适用性和发展前景进行了讨论。
英文摘要:
The histogram is an analysis tool in widespread use within many sciences, with high energy physics as a prime example. However, there exists an inherent bias in the choice of binning for the histogram, with different choices potentially leading to different interpretations. This paper aims to eliminate this bias using two "debinning" algorithms. Both algorithms generate an observed cumulative distribution function from the data, and use it to construct a representation of the underlying probability distribution function. The strengths and weaknesses of these two algorithms are compared and contrasted. The applicability and future prospects of these algorithms is also discussed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。