DocumentCode :
2533714
Title :
Incremental methods for simple problems in time series: algorithms and experiments
Author :
Zhao, Xiaojian ; Zhang, Xin ; Neylon, Tyler ; Shasha, Dennis
Author_Institution :
Courant Inst. of Math. Sci., New York Univ., NY, USA
fYear :
2005
fDate :
25-27 July 2005
Firstpage :
3
Lastpage :
14
Abstract :
A time series (or equivalently a data stream) consists of data arriving in time order. Single or multiple data streams arise in fields including physics, finance, medicine, and music, to name a few. Often the data comes from sensors (in physics and medicine for example) whose data rates continue to improve dramatically as sensor technology improves and as the number of sensors increases. So fast algorithms become ever more critical in order to distill knowledge from the data. This paper presents our recent work regarding the incremental computation of various primitives: windowed correlation, matching pursuit, sparse space discovery and elastic burst detection. The incremental idea reflects the fact that recent data is more important than older data. Our StatStream system contains an implementation of these algorithms, permitting us to do empirical studies on both simulated and real data.
Keywords :
algorithm theory; sensors; time series; StatStream system; data stream; elastic burst detection; incremental methods; matching pursuit; sensors; simple problems; sparse space discovery; time series; windowed correlation; Computational modeling; Data security; Earth; Filters; Finance; Matching pursuit algorithms; Null space; Physics; Satellites; Space technology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Database Engineering and Application Symposium, 2005. IDEAS 2005. 9th International
ISSN :
1098-8068
Print_ISBN :
0-7695-2404-4
Type :
conf
DOI :
10.1109/IDEAS.2005.35
Filename :
1540890
Link To Document :
بازگشت