Skip to main content
Article thumbnail
Location of Repository

January 11, 2006 18:1 WSPC/Trim Size: 11in x 8.5in for Proceedings sieve˙ox THE “SIEVE ” ALGORITHM—SIFTING DATA IN THE REAL WORLD

By M. M. Block


Experimental data are rarely, if ever, distributed as a normal (Gaussian) distribution, in real world applications. A large set of data—such as the cross sections for particle scattering as a function of energy contained in the archives of the Particle Data Group 1 —is a compendium of all published data, and hence, unscreened. For many reasons, these data sets have many outliers—points well beyond what is expected from a normal distribution—thus ruling out the use of conventional χ 2 techniques. We suggest an adaptive algorithm that applies to the data sample a sieve whose mesh is coarse enough to let the background fall through, but fine enough to retain the preponderance of the signal, thus sifting the data. The “Sieve ” algorithm gives a robust estimate of the best-fit model parameters in the presence of a noisy background, together with a robust estimate of the model parameter errors, as well as a determination of the goodness-of-fit of the data to the theoretical hypothesis. Computer simulations were carried out to test the algorithm for both its accuracy and stability under varying background conditions. 1

Year: 2008
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.