mice
mice can finally predict, not just estimate, from multiply imputed data.
Comparison · Infra & APIs
anticlust vs rollupTree
A side-by-side editorial comparison of anticlust and rollupTree — release velocity, themes, recent moves, and the top alternatives to consider.
anticlust vs rollupTree: at a glance
What is anticlust?
Anticlustering keeps absorbing constraints — must-link, cannot-link, blocks, missing data
anticlust partitions a set of items into groups that are as similar to each other as possible — assembling matched stimulus sets, balanced experimental conditions, comparable teaching groups. The current surface is one function, anticlustering(), with a growing list of things it will honour: must-link and cannot-link constraints, categorical variables as factors, NAs, blocking by a categorical level, and a choice among exact solvers and heuristics.
What is rollupTree?
The recursive-computation engine under massProps grows the accessors its consumer needed
rollupTree performs recursive computations over tree and DAG structures — the generic engine that its author's massProps package uses to roll mass properties up an assembly breakdown. It is small and moves slowly: five releases in a year, of which two are README and vignette work. The current surface added row-level get and set accessors by key and by id at 0.4.0.
anticlust vs rollupTree: editorial side-by-side
anticlust
0.0INFRA · APIS
Anticlustering keeps absorbing constraints — must-link, cannot-link, blocks, missing data
◆ Current state
anticlust partitions a set of items into groups that are as similar to each other as possible — assembling matched stimulus sets, balanced experimental conditions, comparable teaching groups. The current surface is one function, anticlustering(), with a growing list of things it will honour: must-link and cannot-link constraints, categorical variables as factors, NAs, blocking by a categorical level, and a choice among exact solvers and heuristics.
◆ Where it's heading
Two years of releases have gone almost entirely into constraint handling and input tolerance rather than new objectives. The methods list grew by absorbing outside work — the three-phase search of Yang et al. contributed by an external author, a 2PML heuristic for must-link problems, a Gurobi backend for the exact formulations. Meanwhile categories_to_binary() has been rewritten twice, which is where the recent bugs have come from.
◆ Prediction
The constraint types now interact combinatorially — blocks, must-link, cannot-link, missing values and each objective — and the last two releases were both regressions in the encoding layer underneath them. Consolidating that layer is the more likely next move than another solver.
rollupTree
0.0INFRA · APIS
The recursive-computation engine under massProps grows the accessors its consumer needed
◆ Current state
rollupTree performs recursive computations over tree and DAG structures — the generic engine that its author's massProps package uses to roll mass properties up an assembly breakdown. It is small and moves slowly: five releases in a year, of which two are README and vignette work. The current surface added row-level get and set accessors by key and by id at 0.4.0.
◆ Where it's heading
The package develops in response to its one visible consumer. The 0.4.0 accessors appeared in January 2026 and massProps switched to them thirteen days later; 0.4.1 then fixed missing column names in the setters, which is the kind of defect only real use surfaces. Before that, 0.3.0's default_validate_dag() extended validation past strict trees to directed acyclic graphs, widening what structures the engine will accept.
◆ Prediction
On the established pattern the next release will be whatever massProps needs next, discovered by using it. A DAG validator suggests non-tree structures are in scope, but nothing in these notes says that path is being pushed further.
Alternatives to anticlust and rollupTree
Other Infra & APIs products tracked by Sparkpulse, ranked by recent ship velocity. Each card links to a full editorial trajectory and lets you pivot into a head-to-head comparison with either anticlust or rollupTree.
PINstimation
A market-microstructure toolkit that keeps adding estimators as the papers land.
nzilbb.vowels
A vowel-analysis package trimming dependencies after an email address got it archived.
emuR
The R half of the EMU speech database system, fixing what was quietly broken.
BAS
A Bayesian model-averaging package spending its 2.0 on memory, not methods.
tidyplots
tidyplots keeps rebuilding its own foundations rather than layering around them.
See all anticlust alternatives → · See all rollupTree alternatives →
Recent activity from anticlust and rollupTree
Latest ship moves from both products, interleaved chronologically. ⚡ = editorial spark.
- 4mo agoanticlustOne-hot encoding regression from 0.8.13 reverted
- 6mo agorollupTreeMissing column names in the new row setters
- 6mo agorollupTreeRow-level get and set accessors by key and by id
- 8mo agoanticlustblocks argument applies anticlustering level by level
- 9mo agoanticlustMissing values, factor columns, and the three-phase search
- 1y agoanticlustEdge cases in the previous release's cannot-link handling
- 1y agoanticlustVector cannot-link constraints skip the solver entirely
- 1y agorollupTreeMinor vignette improvements
- 1y agorollupTreeBadges and GitHub Actions added to the README
- 1y agoanticlustUncaught test error flagged by CRAN additional checks
- 1y agorollupTreedefault_validate_dag() extends validation past strict trees
Frequently asked questions
What is the difference between anticlust and rollupTree?
They serve adjacent needs but don't currently overlap on shipped themes. anticlust and rollupTree are shipping at a similar cadence (velocity 0.0 vs 0.0, both within Sparkpulse's "active" band). See the at-a-glance table above for a side-by-side breakdown of velocity, recent sparks, and editorial themes.
Is anticlust better than rollupTree?
Sparkpulse doesn't pick a winner — we score release velocity, not feature parity. anticlust and rollupTree are shipping at a similar cadence (velocity 0.0 vs 0.0, both within Sparkpulse's "active" band). For your specific use case, the alternatives sections above list other Infra & APIs products to evaluate alongside.
What are the best alternatives to anticlust?
Top anticlust alternatives in Infra & APIs are ranked by recent ship velocity. Browse the "anticlust alternatives" section above for the current picks, or visit /alternatives/anticlust for the full list with editorial commentary on each.
What are the best alternatives to rollupTree?
Top rollupTree alternatives in Infra & APIs are ranked by recent ship velocity. Browse the "rollupTree alternatives" section above for the current picks, or visit /alternatives/rolluptree for the full list with editorial commentary on each.