השוואת שיטות

	ממוצע בריצנטרי של DTW	Dynamic Time Warping
תחום	סדרות עתיות	קבלת החלטות
משפחה	Process / pipeline	MCDM
שנת המקור	2011	1978
הוגה השיטה	François Petitjean	Hideki Sakoe and Seibi Chiba
סוג	Distance-based time-series aggregation	Elastic sequence alignment metric
מקור מכונן	Salvador, S., & Chan, P. (2004). FastDTW: Toward accurate dynamic time warping in linear time and space. Intelligent Data Analysis, 11(5), 561–580.	Sakoe, H., & Chiba, S. (1978). Dynamic programming algorithm optimization for spoken word recognition. IEEE Transactions on Acoustics, Speech, and Signal Processing, 26(1), 43-49.
כינויים	DBA, DTW-BA, Barycenter Averaging	DTW, dynamic programming time warping, elastic distance
קשורות	4	1
תקציר	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.	Dynamic Time Warping is a distance metric for comparing time series or sequential data that may vary in length or speed. Introduced by Hideki Sakoe and Seibi Chiba in 1978 for speech recognition, DTW measures the minimal cumulative distance needed to align two sequences using dynamic programming. Unlike fixed-distance metrics, DTW allows flexible time warping, making it ideal for sequences that are similar in shape but offset or scaled differently in time.