A modular CDF approach for the approximation of percentiles


Journal Article

This article describes a method for computing approximate statistics for large data sets, when exact computations may not be feasible. Such situations arise in applications such as climatology, data mining, and information retrieval (search engines). The key to our approach is a modular approximation to the cumulative distribution function (cdf) of the data. Approximate percentiles (as well as many other statistics) can be computed from this approximate cdf. This enables the reduction of a potentially overwhelming computational exercise into smaller, manageable modules. We illustrate the properties of this algorithm using a simulated data set. We also examine the approximation characteristics of the approximate percentiles, using a von Mises functional type approach. In particular, it is shown that the maximum error between the approximate cdf and the actual cdf of the data is never more than 1% (or any other preset level). We also show that under assumptions of underlying smoothness of the cdf, the approximation error is much lower in an expected sense. Finally, we derive bounds for the approximation error of the percentiles themselves. Simulation experiments show that these bounds can be quite tight in certain circumstances.

Full Text

Duke Authors

Cited Authors

  • Choudhury, KR; Tabirca, S

Published Date

  • November 1, 2008

Published In

Volume / Issue

  • 37 / 10

Start / End Page

  • 1948 - 1965

Electronic International Standard Serial Number (EISSN)

  • 1532-4141

International Standard Serial Number (ISSN)

  • 0361-0918

Digital Object Identifier (DOI)

  • 10.1080/03610910802296356

Citation Source

  • Scopus