Implementation of algorithms that extend IPF to nested structures.
The IPF algorithm operates on count data. This package offers implementations for several algorithms that extend this to nested structures: “parent” and “child” items for both of which constraints can be provided.
grake: A reimplementation of generalized raking (Deville and Särndal, 1992; Deville, Särndal and Sautory, 1993)
wrswoR: An implementation of fast weighted random sampling without replacement (Efraimidis and Spirakis, 2006)mangow: Embed the Gower distance metric in L1RANN.L1: k-nearest neighbors using the L1 metric
The package is not currently on CRAN, but can be installed from GitHub with:
# install.packages("devtools")
devtools::install_github("krlmlr/mlfit")From version 0.4.0 onwards the package is now to be known as mlfit.
If you would like to install any version that is older than 0.4.0
please use:
# See https://github.com/krlmlr/mlfit/releases for the releases that are available
# To install a certain branch or commit or tag, append it to the repo name, after an @:
devtools::install_github("krlmlr/MultiLevelIPF@v0.3-7")