방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| DTW Barycenter Averaging (DBA)× | 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. link ↗ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗ |
| 별칭≠ | 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. |
| ScholarGate데이터셋 ↗ |
|
|