fdacluster vs OptimalBinningWoE

fdacluster clusters functional data while separating amplitude from phase variation, aligning curves as part of the clustering rather than before it. The algorithm set covers k-means, hierarchical clustering and DBSCAN, all producing a common caps result object so runs can be compared directly. Version 0.4.0 tightened the interface with is_domain_interval and transformation arguments describing the input data, added compatibility checking between incompatible option combinations, and split the L2 and normalized L2 distances into separate C++ classes to enforce that plain L2 cannot be combined with dilation or affine warping it is not invariant to.

The trajectory runs from method implementation toward guardrails and portability. Early releases added capability; recent ones prevent misuse and reduce weight - dplyr, forcats, tidyr and purrr removed in 0.4.0, furrr swapped for future.apply - while 0.4.2 is entirely C++ correctness, replacing Armadillo's whole-object finiteness check with scalar std::isfinite and fixing an integer overflow in linear index computation that broke large datasets. Cadence is roughly one release a year.

Given that the last two releases were dependency reduction and numerical correctness rather than method work, expect the next to continue in that vein unless a new clustering algorithm is contributed.