Σύγκριση μεθόδων

	Μέση Τιμή Βαρυκέντρου DTW	Ομαδοποίηση K-means
Πεδίο	Χρονοσειρές	Μηχανική Μάθηση
Οικογένεια	Process / pipeline	Machine learning
Έτος προέλευσης	2011	1967 (formalized 1982)
Δημιουργός	François Petitjean	MacQueen, J. B.; Lloyd, S. P.
Τύπος	Distance-based time-series aggregation	Partitional clustering
Θεμελιώδης πηγή	Salvador, S., & Chan, P. (2004). FastDTW: Toward accurate dynamic time warping in linear time and space. Intelligent Data Analysis, 11(5), 561–580.	Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137.
Εναλλακτικές ονομασίες	DBA, DTW-BA, Barycenter Averaging	k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Συναφείς	4	4
Σύνοψη	DTW Barycenter Averaging (DBA) is a method for computing the average or representative sequence of a set of time series that respects temporal warping and elastic distance. Unlike Euclidean averaging which requires point-wise alignment, DBA minimizes the sum of Dynamic Time Warping (DTW) distances, producing a meaningful average for sequences with flexible temporal alignments. Introduced by Petitjean and colleagues in 2011, it is widely used in time-series clustering and summarization.	K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis.