Extension of prefix span approach with GRC constraints for sequential pattern mining

Prefixspan algorithm with GRC constraints which generates sequential patterns by using prefix projected pattern growth approach is implemented. Other than frequency this algorithm also uses gap, compactness and recency constraints during sequential pattern mining process. The gap constraint applies limit on the separation of two consecutive transactions of discovered patterns, recency constraint makes patterns to quickly adapt the latest behaviors and compactness constraint make sure reasonable time spans for the discovered patterns.