NegI-NSP: Negative sequential pattern mining based on loose constraints
Authors:
- 1 October 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3419-3425
Abstract
Negative sequential patterns (NSP) become increasingly important and most of the existing methods introduce so strict constraints that many meaningful patterns would be lost. In this paper, we loosen these constraints and solve a series of consequent problems. Firstly, negative containment is defined to determine whether a data sequence contains a negative sequence. Secondly, an efficient method to fast calculate the supports of negative sequences is proposed. Finally, a novel and efficient algorithm, NegI-NSP, is proposed to efficiently identify meaningful NSP. Experiments show that NegI-NSP can efficiently obtain more meaningful patterns by directly using existing PSP mining algorithms.Keywords
This publication has 8 references indexed in Scilit:
- e-NSPFI: Efficient Mining Negative Sequential Pattern from Both Frequent and Infrequent Positive Sequential PatternsInternational Journal of Pattern Recognition and Artificial Intelligence, 2017
- e-NSP: Efficient negative sequential pattern miningArtificial Intelligence, 2016
- Select actionable positive or negative sequential patternsJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology, 2015
- Nonoccurring Behavior Analytics: A New AreaIEEE Intelligent Systems, 2015
- An Efficient GA-Based Algorithm for Mining Negative Sequential Patterns2010
- Domain Driven Data Mining2010
- Mining Negative Sequential Patterns for E-commerce Recommendations2008
- Mining sequential patterns: Generalizations and performance improvements1996