One-off Negative Sequential Pattern Mining
Youxi Wu, Mingjie Chen, Yan Li, Jing Liu, Zhao Li, Jinyan Li, Xindong, Wu

TL;DR
This paper introduces ONP-Miner, an efficient algorithm for mining one-off negative sequential patterns with gap constraints, improving pattern relevance and performance for applications like traffic prediction.
Contribution
It proposes a novel ONP-Miner algorithm that considers one-off conditions and gap constraints, enhancing negative sequential pattern mining efficiency and relevance.
Findings
ONP-Miner outperforms existing algorithms in efficiency.
It discovers more relevant patterns in traffic data.
The method improves traffic prediction accuracy.
Abstract
Negative sequential pattern mining (SPM) is an important SPM research topic. Unlike positive SPM, negative SPM can discover events that should have occurred but have not occurred, and it can be used for financial risk management and fraud detection. However, existing methods generally ignore the repetitions of the pattern and do not consider gap constraints, which can lead to mining results containing a large number of patterns that users are not interested in. To solve this problem, this paper discovers frequent one-off negative sequential patterns (ONPs). This problem has the following two characteristics. First, the support is calculated under the one-off condition, which means that any character in the sequence can only be used once at most. Second, the gap constraint can be given by the user. To efficiently mine patterns, this paper proposes the ONP-Miner algorithm, which employs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Imbalanced Data Classification Techniques · Network Security and Intrusion Detection
