首页> 外文会议>ACM SIGKDD international conference on knowledge discovery and data mining;KDD 10 >DUST: A Generalized Notion of Similarity between Uncertain Time Series
【24h】

DUST: A Generalized Notion of Similarity between Uncertain Time Series

机译:DUST:不确定时间序列之间的相似性的广义概念

获取原文

摘要

Large-scale sensor deployments and an increased use of privacy-preserving transformations have led to an increasing interest in mining uncertain time series data. Traditional distance measures such as Euclidean distance or dynamic time warping are not always effective for analyzing uncertain time series data. Recently, some measures have been proposed to account for uncertainty in time series data. However, we show in this paper that their applicability is limited. In specific, these approaches do not provide an intuitive way to compare two uncertain time series and do not easily accommodate multiple error functions.In this paper, we provide a theoretical framework that generalizes the notion of similarity between uncertain time series. Secondly, we propose DUST, a novel distance measure that accommodates uncertainty and degenerates to the Euclidean distance when the distance is large compared to the error. We provide an extensive experimental validation of our approach for the following applications: classification, top-k motif search, and top-k nearest-neighbor queries.
机译:大规模的传感器部署和对隐私保护的转换的越来越多的使用,导致人们对挖掘不确定的时间序列数据越来越感兴趣。传统的距离度量(例如欧几里得距离或动态时间扭曲)在分析不确定的时间序列数据时并不总是有效的。最近,已经提出了一些措施来解决时间序列数据中的不确定性。但是,我们在本文中表明它们的适用性受到限制。特别地,这些方法没有提供比较两个不确定时间序列的直观方法,并且不容易容纳多个误差函数。 在本文中,我们提供了一个理论框架,可以概括不确定时间序列之间的相似性概念。其次,我们提出了DUST,这是一种新颖的距离量度,它可以容纳不确定性,并且当距离远大于误差时,可以退化为欧几里得距离。我们为以下应用提供了广泛的实验验证方法:分类,top-k主题搜索和top-k最近邻居查询。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号