针对时间序列子序列聚类存在的平凡相似和水平伸缩等问题，提出了一种新的子序列聚类算法。
A new subsequence cluster algorithm is proposed to solve the trivial similarity and horizontal stretching problem.
针对时间序列子序列聚类存在的平凡相似和水平伸缩等问题，提出了一种新的子序列聚类算法。
A new subsequence cluster algorithm is proposed to solve the trivial similarity and horizontal stretching problem.
应用推荐