anticlust

The method of anticlustering partitions a pool of elements into groups (i.e., anticlusters) with the goal of maximizing between-group similarity or within-group heterogeneity. The anticlustering approach thereby reverses the logic of cluster analysis that strives for high within-group homogeneity and clear separation between 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 main function anticlustering() gives access to optimal and heuristic anticlustering methods described in Papenberg and Klau (2021; doi:10.1037/met0000301), Brusco et al. (2020; doi:10.1111/bmsp.12186), Papenberg (2024; doi:10.1111/bmsp.12315), Papenberg, Wang, et al. (2025; doi:10.1016/j.crmeth.2025.101137), Papenberg, Breuer, et al. (2025; doi:10.1017/psy.2025.10052), Yang et al. (2022; doi:10.1016/j.ejor.2022.02.003), and Wu et al. (2025; doi:10.1016/j.cor.2025.107030). The optimal algorithms require that an integer linear programming solver is installed. This package will install 'lpSolve' (https://cran.r-project.org/package=lpSolve) as a default solver, but it is also possible to use the package 'Rglpk' (https://cran.r-project.org/package=Rglpk), which requires the GNU linear programming kit (https://www.gnu.org/software/glpk/glpk.html), the package 'Rsymphony' (https://cran.r-project.org/package=Rsymphony), which requires the SYMPHONY ILP solver (https://github.com/coin-or/SYMPHONY), or the commercial solver Gurobi, which provides its own R package that is not available via CRAN (https://www.gurobi.com/downloads/). 'Rglpk', 'Rsymphony', 'gurobi' and their system dependencies have to be manually installed by the user because they are only suggested dependencies. Full access to the bicriterion anticlustering method proposed by Brusco et al. (2020) is given via the function bicriterion_anticlustering(), while kplus_anticlustering() implements the full functionality of the k-plus anticlustering approach proposed by Papenberg (2024). 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 clustering.

Help pages

27

Examples that run

96%26 run in a plain check · 1 only when donttest examples are enabled (R CMD check --as-cran)

Exported functions with examples

100%

Documented parameters

100%

Return-value docs

84%

Help pages citing references

67%

Installing anticlust adds 2 packages (2 with compiled code, 516 KB of source tarballs). Heaviest: lpSolve 457 KB, RANN 59 KB.

Pick two releases to compare their code metrics.

First published

2020-06-29

Total releases

24 / 6 yrs

License

MIT + file LICENSE OSI

Minimum R

≥ 3.6.0

Bundled data

17 KB / 2 files

Download size

622 KB

Cite this package

Run in R for the authors' entry:

The package provides a citation file, so citation() returns the authors' own entry.

It points to 10.1037/met0000301.

Cite the R Observatory

For a number measured here: a download total, a coverage figure, an archival date.

From data release v2026-10-23, which the citation names so these numbers can be found later. More on citing and the projects behind them.