Constraint-based Sequential Rule Mining

Sequential rule mining (SRM) is an alternative to sequential pattern mining (SPM) when dealing with sequence data. SRM has a wide range of applications in numerous data analysis scenarios. Existing SRM algorithms usually discover the entire set of rules in the databases, which makes it not only difficult to analyze results because the discovered set is too large, but also does not consider the user's expectations and background knowledge. To tackle this problem, researchers have explored related algorithms with different constraints according to their requirements. In this paper, we propose a flexible constraintbased SRM algorithm called ConSRM for discovering only the sequential rules within user-specified time bounds in a sequence database. This algorithm uses an efficient rule-growth method and develops corresponding constraints and pruning strategies to reduce the search space and speed up calculation. Comprehensive experiments were carried out on four real datasets to evaluate the performance (both effectiveness and efficiency) of ConSRM.