Explicit and Implicit Pattern Relation Analysis for Discovering Actionable Negative Sequences
Wei Wang, Longbing Cao

TL;DR
This paper introduces a novel approach for discovering actionable negative sequential patterns by modeling explicit and implicit relations in a graph, significantly improving the relevance and diversity of patterns for decision-making.
Contribution
It proposes a DPP-based graph model and a new method EINSP for identifying diverse, significant, and actionable negative sequential patterns, addressing limitations of previous frequentist approaches.
Findings
EINSP effectively discovers diverse and significant NSPs.
The method improves pattern relevance and reduces redundancy.
The approach is validated through theoretical analysis and empirical experiments.
Abstract
Real-life events, behaviors and interactions produce sequential data. An important but rarely explored problem is to analyze those nonoccurring (also called negative) yet important sequences, forming negative sequence analysis (NSA). A typical NSA area is to discover negative sequential patterns (NSPs) consisting of important non-occurring and occurring elements and patterns. The limited existing work on NSP mining relies on frequentist and downward closure property-based pattern selection, producing large and highly redundant NSPs, nonactionable for business decision-making. This work makes the first attempt for actionable NSP discovery. It builds an NSP graph representation, quantify both explicit occurrence and implicit non-occurrence-based element and pattern relations, and then discover significant, diverse and informative NSPs in the NSP graph to represent the entire NSP set for…
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
