On Clustering Time Series Using Euclidean Distance and Pearson Correlation
원문 초록
For time series comparisons, it has often been observed that z-score normalized Euclidean distances far outperform the unnormalized variant. In this paper we show that a z-score normalized, squared Euclidean Distance is, in fact, equal to a distance based on Pearson Correlation. This has profound impact on many distance-based classification or clustering methods. In addition to this theoretically sound result we also show that the often used k-Means algorithm formally needs a mod ification to keep the interpretation as Pearson correlation strictly valid. Experimental results demonstrate that in many cases the standard k-Means algorithm generally produces the same results.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Support Vector Machines with Time Series Distance Kernels for Action Classification
A Review of the Long Horizon Forecasting Problem in Time Series Analysis
The interplay of robustness and generalization in quantum machine learning
A Better Alternative to Piecewise Linear Time Series Segmentation
Process mining-driven modeling and simulation to enhance fault diagnosis in cyber-physical systems
The Shape of Consumer Behavior: A Symbolic and Topological Analysis of Time Series
토론
이 논문과 연결된 포럼 글이 아직 없습니다.