방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| DTW Barycenter Averaging (DBA)× | 계층적 군집화× | |
|---|---|---|
| 분야≠ | 시계열 분석 | 머신러닝 |
| 계열≠ | Process / pipeline | Machine learning |
| 기원 연도≠ | 2011 | 1963 |
| 창시자≠ | François Petitjean | Ward, J. H. |
| 유형≠ | Distance-based time-series aggregation | Unsupervised clustering (agglomerative) |
| 원전≠ | Salvador, S., & Chan, P. (2004). FastDTW: Toward accurate dynamic time warping in linear time and space. Intelligent Data Analysis, 11(5), 561–580. link ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| 별칭≠ | DBA, DTW-BA, Barycenter Averaging | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| 관련 | 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. | Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963. |
| ScholarGate데이터셋 ↗ |
|
|