X-Git-Url: https://git.auder.net/?p=epclust.git;a=blobdiff_plain;f=README.md;h=3c88963a4da2af76ca096b1c351580321dc429f3;hp=f1ef56fa929e1c8c6845245fe760914cc722483b;hb=HEAD;hpb=62deb4244895a20a35397dfb062f0b9fe94c5012 diff --git a/README.md b/README.md index f1ef56f..3c88963 100644 --- a/README.md +++ b/README.md @@ -6,10 +6,8 @@ Joint work with [Jairo Cugliari](http://eric.univ-lyon2.fr/~jcugliari/), --- -This program takes n time-series in input and is divided in two stages: - 1) (Heuristic) k-medoids algorithm in parallel to obtain K centers, K << n - 2) Filtering WER(?) to obtain the final k < K group representations. +This program takes N time-series in input and is divided in two stages: + 1. (Heuristic) k-medoids algorithm in parallel to obtain K1 centers, K1 ≪ N + 2. Clustering from WER distances to obtain the final K2 < K1 group representations ---- - -The folder ... contains ... (TODO) +See ?epclust once the package is loaded.