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.