2020/02/17 by Thomas Guyet, Guyet, Thomas, Philippe Besnard +1 · 2 citations
Chemistry · Computer Science · Mathematics · #Ambiguity #Arithmetic #Artificial Intelligence (cs.AI) #Chemistry #Computer science #Containment (computer programming) #Data Mining Algorithms and Applications #Databases (cs.DB) #Discrete mathematics #Equivalence (formal languages) #FOS: Computer and information sciences #Mathematics #Monotonic function #Natural Language Processing Techniques #Notation #Operational semantics #Programming language #Rough Sets and Fuzzy Logic #Semantics (computer science) #Sequence (biology) #Theoretical computer science #cs.AI #cs.DB
paper · pdf · doi:10.48550/arxiv.2002.06920
published in arXiv (Cornell University) (Cornell University) · proceedings of European Conference on Artificial Intelligence (ECAI), Jun 2020, Santiago de Compostela, Spain
openalex publication_date 2020/02/17 · arxiv created 2020/02/21 · arxiv updated 2020/02/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the field of pattern mining, a negative sequential pattern is specified by means of a sequence consisting of events to occur and of other events, called negative events, to be absent. For instance, containment of the pattern ⟨ a ¬ b c⟩ arises with an occurrence of a and a subsequent occurrence of c but no occurrence of b in between. This article is to shed light on the ambiguity of such a seemingly intuitive notation and we identify eight possible semantics for the containment relation between a pattern and a sequence. These semantics are illustrated and formally studied, in particular we propose dominance and equivalence relations between them. Also we prove that support is anti-monotonic for some of these semantics. Some of the results are discussed with the aim of developing algorithms to extract efficiently frequent negative patterns.