z-logo
open-access-imgOpen Access
A comparison of methods for representing sparsely sampled random quantities.
Author(s) -
Vicente Romero,
Laura Swiler,
Angel Urbina,
Joshua Mullins
Publication year - 2013
Publication title -
osti oai (u.s. department of energy office of scientific and technical information)
Language(s) - English
Resource type - Reports
DOI - 10.2172/1096268
Subject(s) - range (aeronautics) , representation (politics) , percentile , reliability (semiconductor) , computer science , probability density function , kernel density estimation , calibration , kernel (algebra) , uncertainty quantification , sparse approximation , statistics , mathematics , data mining , algorithm , power (physics) , materials science , physics , quantum mechanics , combinatorics , estimator , politics , political science , law , composite material
This report discusses the treatment of uncertainties stemming from relatively few samples of random quantities. The importance of this topic extends beyond experimental data uncertainty to situations involving uncertainty in model calibration, validation, and prediction. With very sparse data samples it is not practical to have a goal of accurately estimating the underlying probability density function (PDF). Rather, a pragmatic goal is that the uncertainty representation should be conservative so as to bound a specified percentile range of the actual PDF, say the range between 0.025 and .975 percentiles, with reasonable reliability. A second, opposing objective is that the representation not be overly conservative; that it minimally over-estimate the desired percentile range of the actual PDF. The presence of the two opposing objectives makes the sparse-data uncertainty representation problem interesting and difficult. In this report, five uncertainty representation techniques are characterized for their performance on twenty-one test problems (over thousands of trials for each problem) according to these two opposing objectives and other performance measures. Two of the methods, statistical Tolerance Intervals and a kernel density approach specifically developed for handling sparse data, exhibit significantly better overall performance than the others.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom