A Whole Sequence Matching Algorithm for Event Sequences
On the basis of analyzing the newly time sequence research achievement nowadays, this paper addresses the problem of the whole event sequences matching, a type of sequence matching that retrieves and matching the occurrences patterns from chaotic and nonlinear event sequences. In this paper, several definitions on event relativity are put forward, 3-tuple is employed to present the event, the chain table is developed to describe the event sequence, and the whole similarity sequence matching model for the compact storage of the event sequence is presented, and then it is analysis. In this paper, we first given the definition of event sequences and then propose a 3-tuple method to descript events and employs chain tables to storage them.
time sequence 3-tuple event sequence similarity matching chain table algorithm
Hong-Xia WANG Jun-Jie CHEN
College of Computer Science and Technology Taiyuan University of Technology Shanxi Water Technical P College of Computer Science and Technology Taiyuan University of Technology Taiyuan, Shanxi province
国际会议
北京
英文
529-532
2010-09-18（万方平台首次上网日期，不代表论文的发表时间）