Computer Algebra and Algorithms for Unbiased Moment Estimation of Arbitrary Order

Cogent Math Stat. 2019;6(1):1701917. doi: 10.1080/25742558.2019.1701917. Epub 2019 Dec 21.

Abstract

While unbiased central moment estimators of lower orders (such as a sample variance) are easily obtainable and often used in practice, derivation of unbiased estimators of higher orders might be more challenging due to long math and tricky combinatorics. Moreover, higher orders necessitate calculation of estimators of powers and products that also amount to these orders. We develop a software algorithm that allows the user to obtain unbiased estimators of an arbitrary order and provide results up to the 6th order, including powers and products of lower orders. The method also extends to finding pooled estimates of higher central moments of several different populations (e.g. for two-sample tests). We introduce an R package Umoments that calculates one- and two-sample estimates and generates intermediate results used to obtain these estimators.

Keywords: Combinatorics; empirical moments; higher-order approximations; pooled estimates.