期刊文献+

不确定时间序列的降维及相似性匹配 被引量:2

Dimensionality Reduction and Similarity Match of Uncertain Time Series
下载PDF
导出
摘要 不确定时间序列的每个时间点上对应一个可能取值的集合,无法给出其确定值,这种不确定性给时间序列降维处理和相似性匹配带来巨大挑战,现有的时间序列降维方法和相似性匹配算法已经无法适用。针对此问题,提出了描述统计模型,将不确定时间序列归约为3条确定时间序列,通过离散傅里叶变换(discrete Fourier transform,DFT)、离散余弦变换(discrete cosine transform,DCT)、离散小波变换(discrete wavelet transform,DWT)对模型下不确定时间序列降维;根据模型特点,提出了以观察值区间和区间集中趋势为核心的相似性匹配算法。经过实验验证,描述统计模型下DCT和DWT有良好的降维效果,提出的相似匹配算法与现有算法相比提高了匹配准确率。 The value of uncertain time series at each timeslot is derived from a set with possible values, it is hard to judge which one is the determined value. This uncertainty is a huge challenge for dimensionality reduction and simi- larity match. Existing time series dimensionality reduction and similarity match methods have been unable to apply. To solve this problem, this paper models uncertain time series with descriptive statistics, reduces an uncertain time series to three certain time series which dimensionality is reduced by DFT (discrete Fourier transform), DCT (discrete cosine transform) and DWT (discrete wavelet transform). This paper also presents the similarity match algorithm based on observations interval and central tendency. After the trial validation, under the descriptive statistics model, DCT and DWT perform well in dimensionality reduction, the similarity match algorithm proposed in this paper is superior to others existed.
出处 《计算机科学与探索》 CSCD 北大核心 2015年第4期418-428,共11页 Journal of Frontiers of Computer Science and Technology
基金 国家自然科学基金Grant No.61070032~~
关键词 不确定时间序列 降维 相似性匹配 离散傅里叶变换(DFT) 离散余弦变换(DCT) 离散小波变换(DWT) uncertain time series dimensionality reduction similarity match discrete Fourier transform (DFT) dis-crete cosine transform (DCT) discrete wavelet transform (DWT)
  • 相关文献

参考文献23

  • 1Agrawal R, Faloutsos C, Swami A. Efficient similarity search in sequence databases[M]. Berlin, Heidelberg: Springer, 1993: 69-84.
  • 2Sathe S, Jeung H, Aberer K. Creating probabilistic databases from imprecise time-series data[C]//Proceedings of the 27th International Conference on Data Engineering, Hannover, Germany, 2011. Piscataway, NJ, USA: IEEE, 2011: 327-338.
  • 3Bemecker T, Emrich T, Kriegel H, et al. A novel probabilistic pruning approach to speed up similarity queries in uncertain databases[C]//Proceedings of the 27111 International Confer- ence on Data Engineering, Harmover, Germany, 2011. Pis- cataway, NJ, USA: IEEE, 2011: 339-350.
  • 4Agrawal R, Faloutsos C, Swami A. Efficient similarity search in sequence databases[C]//LNCS 730: Proceedings of the 4th International Conference on Foundations of Data Orga- nization and Algorithms, Chicago, USA, Oct 13-15, 1993. Berlin, Heidelberg: Springer, 1993: 69-84.
  • 5Yeh M Y, Wu K L, Yu P S, et al. PROUD: a probabilistic approach to processing similarity queries over uncertain data streams[C]//Proceedings of the 12th International Con- ference on Extending Database Technology, Saint Petersburg, Russia, Mar 24-26, 2009. New York, NY, USA: ACM, 2009: 684-695.
  • 6Sarangi S R, Murthy K. DUST: a generalized notion of simi- larity between uncertain time series[C]//Proceedings of the 16th ACM SIGKDD International Conference on Knowl- edge Discovery and Data Mining, Washington, USA, Jul 25-28, 2010. New York, NY, USA: ACM, 2010: 383-392.
  • 7Faloutsos C, Ranganathan M, Manolopoulos Y. Fast subse- quence matching in time series databases[C]//Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, Minneapolis, USA, 1994. New York, NY, USA: ACM, 1994: 419-429.
  • 8Beckmann N, Kriegel H P, Schneider R, et al. The R*-tree: an efficient and robust access method for points and rectan- gles[C]//Proceedings of the 1990 ACM SIGMOD Interna- tional Conference on Management of Data. New York, NY, USA: ACM, 1990: 322-331.
  • 9Keogh E, Chakrabarti K, Mehrotra S, et al. Locally adaptive dimensionality reduction for indexing large time series data- bases[C]//Proceedings of the 2001 ACM SIGMOD Interna- tional Conference on Management of Data, Santa Barbara, USA, 2001. New York, NY, USA: ACM, 2001: 151-162.
  • 10Rafiei D, Mendelzon A. Efficient retrieval of similar time sequences using DFT[C]//Proceedings of the 5th Interna- tional Conference on Foundations of Data Organizations and Algorithms, Kobe, Japan, 1998. Berlin, Heidelberg: Springer, 1998: 249-257.

同被引文献10

引证文献2

二级引证文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部