Finding redundant patterns with gaps in sequential data

Sequences data are one of the most important types of data. From the sequence data generating the patterns is having more impact and importance in the various areas of data mining. This paper proposes an efficient algorithm for mining sequential patterns which contains the gaps in it. The algorithm gains its efficiency by the use of suffix tree for building the patterns and finding the redundant patterns from the given input string. Also the Delta Closed Pattern generation algorithm is used which gives the delta closed patterns and these patterns are provided as input to second algorithms which gives the number of occurrences of the delta closed patterns from the given input string. By avoiding the gaps it achieves greater efficiency without losing the completeness of mining result. The experimental study shows that our algorithm is efficient in mining the approximate sequential patterns with gaps.