DocumentCode :
2257662
Title :
Online Segmentation Algorithm for Time Series Based on BIRCH Clustering Features
Author :
Tu, Yu ; Liu, Yubao ; Li, Zhijie
Author_Institution :
Dept. of Comput. Sci., Sun Yat-Sen Univ., Guangzhou, China
fYear :
2010
fDate :
11-14 Dec. 2010
Firstpage :
55
Lastpage :
59
Abstract :
Online time series data representation is one of important problems of time series data mining. The adjacent points of time series are inherently depended and hence have similar clustering features. Based on BIRCH clustering features, we present a new kind of OSBC algorithm for time series segmentation in this paper. Using cluster features, OSBC algorithm can find easily the changing patterns of time series and achieve better segmentation results. The time complexity of OSBC algorithm is linear and its space complexity is also much smaller. The experiment results on time series benchmark show the effectiveness of our method.
Keywords :
data structures; pattern clustering; time series; very large databases; BIRCH clustering features; OSBC algorithm; data mining; data representation; online segmentation algorithm; pattern clustering; time series; BIRCH clustering features; online segmentation algorithm; time series;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Security (CIS), 2010 International Conference on
Conference_Location :
Nanning
Print_ISBN :
978-1-4244-9114-8
Electronic_ISBN :
978-0-7695-4297-3
Type :
conf
DOI :
10.1109/CIS.2010.19
Filename :
5696231
Link To Document :
بازگشت