Packaged: 2020-01-07 18:16:41 UTC; dirkschumacher

Packaged: 2020-05-21 09:17:58 UTC; dirkschumacher

Packaged: 2020-10-30 20:40:06 UTC; dirkschumacher

person("Jonathan", "Polonsky", , "polonskyj@who.int", "ctb"),
person(given = "World Health Organization", role = "cph"))
Collate: 'anthro.R' 'utils.R' 'assertions.R' 'prevalence.R'

Title: Computation of the WHO 2007 References for School-Age Children
Description: Provides WHO 2007 References for School-age Children and
Adolescents (5 to 19 years) (z-scores) with

Title: Subset Partitioning via Anticlustering
comment = "centroid based clustering algorithm"),
Author: Martin Papenberg [aut, cre] (<https://orcid.org/0000-0002-9900-4268>),
Meik Michalke [ctb] (centroid based clustering algorithm),
Description: The method of anticlustering partitions a pool of
elements into groups (i.e., anticlusters) in such a way that the
between-group similarity is maximized and -- at the same time -- the
within-group heterogeneity is maximized. This reverses the logic of
cluster analysis that strives for high within-group homogeneity and
low similarity of the different groups. Computationally,
anticlustering is accomplished by maximizing instead of minimizing a
clustering objective function, such as the intra-cluster variance
(used in k-means clustering) or the sum of pairwise distances within
clusters.  The function anticlustering() implements exact and
heuristic anticlustering algorithms as described in Papenberg and Klau
(2020; <doi:10.1037/met0000301>). The exact approach requires that the
(<https://www.gnu.org/software/glpk/glpk.html>) is available and the R
installed. Some other functions are available to solve classical
clustering problems. The function balanced_clustering() applies a
cluster analysis under size constraints, i.e., creates equal-sized
clusters. The function matching() can be used for (unrestricted,
bipartite, or K-partite) matching. The function wce() can be used
optimally solve the (weighted) cluster editing problem, also known as
correlation clustering, clique partitioning problem or transitivity
SystemRequirements: The exact (anti)clustering algorithms require that
the GNU linear programming kit (GLPK library) is installed