[epclust.git] / README.md

# Clustering of EDF power curves from Linky data

Joint work with [Jairo Cugliari](http://eric.univ-lyon2.fr/~jcugliari/),
[Yannig Goude](https://scholar.google.com/citations?user=D-OLEG4AAAAJ&hl=fr) and
[Jean-Michel Poggi](http://www.math.u-psud.fr/~poggi/)

---

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 &#8810; N
  2. Clustering from WER distances to obtain the final K2 &lt; K1 group representations

See ?epclust once the package is loaded.
Commit	Line	Data
b7cd987d BA	1	# Clustering of EDF power curves from Linky data
	2
	3	Joint work with [Jairo Cugliari](http://eric.univ-lyon2.fr/~jcugliari/),
	4	[Yannig Goude](https://scholar.google.com/citations?user=D-OLEG4AAAAJ&hl=fr) and
	5	[Jean-Michel Poggi](http://www.math.u-psud.fr/~poggi/)
	6
	7	---
	8
	9	This program takes N time-series in input and is divided in two stages:
	10	1. (Heuristic) k-medoids algorithm in parallel to obtain K1 centers, K1 ≪ N
	11	2. Clustering from WER distances to obtain the final K2 < K1 group representations
	12
	13	See ?epclust once the package is loaded.