A Universal Formulation of Sequential Patterns

摘要: This report outlines a more general formulation of sequential patterns, which uni es the generalized patterns proposed by Srikant and Agarwal [SA96] episode discovery approach taken Manilla et al [MTV97]. We show that just varying values timing constraint parameters counting methods, our can be made identical to either one these. Furthermore, de nes several other methods could suitable for various applications. The algorithm used discover these universal is based on modi cation GSP in [SA96]. Some cations are take care newly introduced constraints pattern restrictions, whereas some performance reasons. In end, we present an application, illustrates ciencies current approaches overcome formulation.