Many data science problems reduce to operations on very tall,
    skinny matrices.  However, sometimes these matrices can be so tall that they
    are difficult to work with, or do not even fit into main memory.  One
    strategy to deal with such objects is to distribute their rows across
    several processors.  To this end, we offer an 'S4' class for tall, skinny,
    distributed matrices, called the 'shaq'.  We also provide many useful
    numerical methods and statistics operations for operating on these
    distributed objects.  The naming is a bit "tongue-in-cheek", with the class
    a play on the fact that 'Shaquille' 'ONeal' ('Shaq') is very tall, and he
    starred in the film 'Kazaam'.

Provides a weighting approach that employs kernels to make one group have a similar distribution to another group on covariates. This method matches not only means or marginal distributions but also higher-order transformations implied by the choice of kernel. 'kbal' is applicable to both treatment effect estimation and survey reweighting problems. Based on Hazlett, C. (2020) "Kernel Balancing: A flexible non-parametric weighting procedure for estimating causal effects." Statistica Sinica. <https://www.researchgate.net/publication/299013953_Kernel_Balancing_A_flexible_non-parametric_weighting_procedure_for_estimating_causal_effects>.

Computes Khattree-Bahuguna's univariate and multivariate skewness, principal-component-based Khattree-Bahuguna's multivariate skewness. It also provides several measures of univariate or multivariate skewnesses including, Pearson’s coefficient of skewness, Bowley’s univariate skewness and Mardia's multivariate skewness. See Khattree, R. and Bahuguna, M. (2019) <doi: 10.1007/s41060-018-0106-1>.

Implementation of the KCMeans regression estimator studied by 
    Wiemann (2023) <arXiv:2311.17021> for expectation function estimation conditional on 
    categorical variables. Computation leverages the unconditional KMeans 
    implementation in one dimension using dynamic programming algorithm of
    Wang and Song (2011) <doi:10.32614/RJ-2011-015>, allowing for global solutions in time polynomial in 
    the number of observed categories.