关键词: 数据挖掘, 时间序列, 相似性查找, 滑动窗口

Abstract: As a non-trivial problem， the most promising solutions of similarity search in time series databases involve performing dimensionality reduction on the original data. The key to this question is how to effectively keep the original time series information while reducing computational complexity at the best effort. It discusses the slide-window practical application in this area， and then concludes how to get an effective slide-window size in similarity of time series research. To find some useful eigenvalue in time series by mining the distributing values of original series， and deduce a collection of candidate slide-window size， find the optimal slide window size by adapting to the series eigenvalue variable motion movement.

Key words: data mining, time series, similarity match, slide-window