Fast Subsequence Search on Time Series Data
作者： Man Lung Yiu , Zhiguo Gong , Leong Hou U. , Yuhong Li , Bo Tang
关键词: Subsequence 、 Combinatorics 、 Longest increasing subsequence 、 Computer science 、 Longest common subsequence problem 、 Longest alternating subsequence 、 Time series
摘要: 20th International Conference on Extending Database Technology, EDBT 2017, Venice, Italy, 21-24 March 2017
sci-hub.st 参考文章(4)
Thanawin Rakthanmanon, Bilson Campana, Abdullah Mueen, Gustavo Batista, Brandon Westover, Qiang Zhu, Jesin Zakaria, Eamonn Keogh, Addressing Big Data Time Series: Mining Trillions of Time Series Subsequences Under Dynamic Time Warping ACM Transactions on Knowledge Discovery From Data. ,vol. 7, pp. 10- ,(2013) , 10.1145/2500489
Eamonn Keogh, Kaushik Chakrabarti, Michael Pazzani, Sharad Mehrotra, Dimensionality reduction for fast similarity search in large time series databases Knowledge and Information Systems. ,vol. 3, pp. 263- 286 ,(2001) , 10.1007/PL00011669
Eamonn Keogh, Chotirat Ann Ratanamahatana, Exact indexing of dynamic time warping Knowledge and Information Systems. ,vol. 7, pp. 358- 386 ,(2005) , 10.1007/S10115-004-0154-9
Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos, Fast subsequence matching in time-series databases Proceedings of the 1994 ACM SIGMOD international conference on Management of data - SIGMOD '94. ,vol. 23, pp. 419- 429 ,(1994) , 10.1145/191839.191925