Joint work with Jairo Cugliari, Yannig Goude and Jean-Michel Poggi
This program takes N time-series in input and is divided in two stages:
- (Heuristic) k-medoids algorithm in parallel to obtain K1 centers, K1 ≪ N
- Clustering from WER distances to obtain the final K2 < K1 group representations
See ?epclust once the package is loaded.