An efficient implementation of anytime k-medoids clustering for time series under dynamic time warping.
Van The HuyDuong Tuan AnhPublished in: SoICT (2016)
Keyphrases
- dynamic time warping
- lower bounding
- similarity measure
- clustering algorithm
- distance measure
- shape retrieval
- euclidean distance
- elastic matching
- subsequence matching
- sequence matching
- similarity search
- quasi periodic
- nearest neighbor classifier
- self organizing maps
- word spotting
- signature verification
- data clustering
- shape similarity
- longest common subsequence
- edit distance
- databases
- data points
- pairwise
- object recognition
- data mining