An Algorithm for Discovering Frequent Patterns in Non-Synchronous Multiple Time Series
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Discovering frequent patterns in multiple time series is important in practices. Methods appeared in literatures assume that the multiple time series are synchronous, but in the real world, that is not always satisfied, in most cases they are non-synchronous. In this paper, an algorithm for discovering frequent patterns in non-synchronous multiple time series is proposed. In this algorithm, first, the time series is segmented and symbolized with the linear segment representation and the vector shape clustering method,so that each symbol can represent aprimitive and independent pattenr.Thenthe minimal occurrence representaion of time series and the association rule discovery algorithm proposed by Agrawal is combined to extrac frequent patterns of various structures from non-synchonous multiple time series.Compared with the previous methods,the algorithm is more simple and flexible,and does not require time series to be synchronous.Experimental results show the efficency of the algorithm.

    Reference
    Related
    Cited by
Get Citation

李斌,谭立湘,解光军,李海鹰,庄镇泉.非同步多时间序列中频繁模式的发现算法.软件学报,2002,13(3):410-416

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 15,2000
  • Revised:September 26,2000
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063