Finding the most unusual time series subsequence: algorithms and applications

Author： Keogh Eamonn   Lin Jessica   Lee Sang-Hee   Herle Helga  

Publisher： Springer Publishing Company

ISSN： 0219-1377

Source： Knowledge and Information Systems, Vol.11, Iss.1, 2007-01, pp. : 1-27

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems

By Myoupo J-F.   Semé D.  

Journal of Parallel and Distributed Computing, Vol. 57, Iss. 2, 1999-05 ,pp. : 212-223

Academic Press

Access to resources Recommend Favorite

A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases

By Loh Woong-Kee   Kim Sang-Wook   Whang Kyu-Young  

Data Mining and Knowledge Discovery, Vol. 9, Iss. 1, 2004-07 ,pp. : 5-28

Springer Publishing Company

Access to resources Recommend Favorite

Electroencephalogram (EEG) time series classification: Applications in epilepsy

By Chaovalitwongse Wanpracha   Prokopyev Oleg   Pardalos Panos  

Annals of Operations Research, Vol. 148, Iss. 1, 2006-11 ,pp. : 227-250

Springer Publishing Company

Access to resources Recommend Favorite

Hurst Exponent and its Applications in Time-series Analysis

By  

Recent Patents on Computer Science, Vol. 5, Iss. 3, 2012-12 ,pp. : 211-219

Bentham Science Publishers

Access to resources Recommend Favorite

Combinatorial time series forecasting based on clustering algorithms and neural networks

By Sfetsos A.   Siriopoulos C.  

Neural Computing & Applications, Vol. 13, Iss. 1, 2004-04 ,pp. : 56-64

Springer Publishing Company

Access to resources Recommend Favorite