Mining Generalized Flow Patterns

Abstract

In this chapter, we investigate an efficient method to discover this class of relative-location sensitive flow patterns. These generalized flow patterns aim to summarize the sequential relationships between events that are prevalent in sharing the same topological structures. We adopt the pattern growth approach and develop an algorithm called GenSTMiner to discover these patterns. In order to increase the efficiency of the mining process, we also present two optimization techniques. The first is the use of conditional projected databases to prune infeasible events and sequences, and the second is pseudo projection to reduce memory requirement.