arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.00637cs.LG
收藏

一种基于密度的时间序列聚类的通用框架

A General Framework for Density Based Time Series Clustering Exploiting a Novel Admissible Pruning Strategy

University of California, Riverside(加州大学河滨分校);University of Texas at Dallas(德克萨斯大学达拉斯分校)

Nurjahan Begum, Liudmila Ulanova, Hoang Anh Dau, Jun Wang, Eamonn Keogh

摘要:

时间序列聚类是许多高级数据采掘分析中的重要子程序,包括分类器的数据编辑、摘要和离群点检测。众所周知,对于相似性搜索,动态时间弯曲(DTW)相对于欧氏距离的优势随着我们考虑越来越大的数据集而逐渐减弱。然而,正如我们将要展示的,对于集群来说,情况并非如此。DTW下的时间序列聚类仍然是一个计算昂贵的操作。在这项工作中,我们以两种方式解决这个问题。我们提出了一种新的修剪策略,利用上限和下限修剪掉一个非常大的部分昂贵的距离计算。这种修剪策略是可接受的,并给我们可证明相同的结果,蛮力算法,但至少是一个数量级更快。对于数据集,即使是这种水平的加速是不够的,我们表明,我们可以使用一个简单的启发式命令不可避免的计算在一个最有用的第一顺序,从而铸造成一个随时框架的集群。我们展示了我们的想法与天文学,语音生理学,医学和昆虫学领域的单一和多维的案例研究的效用。此外,我们展示了我们的聚类框架的一般性,其他领域的有效获得语义上显着的集群在蛋白质序列中使用的编辑距离,DTW的离散数据模拟。

英文摘要:

Time Series Clustering is an important subroutine in many higher-level data mining analyses, including data editing for classifiers, summarization, and outlier detection. It is well known that for similarity search the superiority of Dynamic Time Warping (DTW) over Euclidean distance gradually diminishes as we consider ever larger datasets. However, as we shall show, the same is not true for clustering. Clustering time series under DTW remains a computationally expensive operation. In this work, we address this issue in two ways. We propose a novel pruning strategy that exploits both the upper and lower bounds to prune off a very large fraction of the expensive distance calculations. This pruning strategy is admissible and gives us provably identical results to the brute force algorithm, but is at least an order of magnitude faster. For datasets where even this level of speedup is inadequate, we show that we can use a simple heuristic to order the unavoidable calculations in a most-useful-first ordering, thus casting the clustering into an anytime framework. We demonstrate the utility of our ideas with both single and multidimensional case studies in the domains of astronomy, speech physiology, medicine and entomology. In addition, we show the generality of our clustering framework to other domains by efficiently obtaining semantically significant clusters in protein sequences using the Edit Distance, the discrete data analogue of DTW.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑