Seqret: Mining Rule Sets from Event Sequences

• URL: http://arxiv.org/abs/2505.06049v1
• Date: Fri, 09 May 2025 13:44:15 GMT
• Title: Seqret: Mining Rule Sets from Event Sequences
• Authors: Aleena Siji, Joscha Cüppers, Osman Ali Mian, Jilles Vreeken,
• Abstract summary: We study the problem of discovering conditional and unconditional dependencies from event sequence data.<n>We do so by discovering rules of the form $X rightarrow Y$ where $X$ and $Y$ are sequential patterns.<n>We propose the Seqret method to discover high-quality rule sets in practice.
• Score: 29.69265042723031
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Summarizing event sequences is a key aspect of data mining. Most existing methods neglect conditional dependencies and focus on discovering sequential patterns only. In this paper, we study the problem of discovering both conditional and unconditional dependencies from event sequence data. We do so by discovering rules of the form $X \rightarrow Y$ where $X$ and $Y$ are sequential patterns. Rules like these are simple to understand and provide a clear description of the relation between the antecedent and the consequent. To discover succinct and non-redundant sets of rules we formalize the problem in terms of the Minimum Description Length principle. As the search space is enormous and does not exhibit helpful structure, we propose the Seqret method to discover high-quality rule sets in practice. Through extensive empirical evaluation we show that unlike the state of the art, Seqret ably recovers the ground truth on synthetic datasets and finds useful rules from real datasets.

Related papers

• Neuro-Symbolic Rule Lists [31.085257698392354]
  NeuRules is an end-to-end trainable model that unifies discretization, rule learning, and rule order into a single framework. We show that NeuRules consistently outperforms neuro-symbolic methods, effectively learning simple and complex rules, as well as their order, across a wide range of datasets.
  arXiv  Detail & Related papers  (2024-11-10T11:10:36Z)
• Temporally Grounding Instructional Diagrams in Unconstrained Videos [51.85805768507356]
  We study the challenging problem of simultaneously localizing a sequence of queries in instructional diagrams in a video.<n>Most existing methods focus on grounding one query at a time, ignoring the inherent structures among queries.<n>We propose composite queries constructed by exhaustively pairing up the visual content features of the step diagrams.<n>We demonstrate the effectiveness of our approach on the IAW dataset for grounding step diagrams and the YouCook2 benchmark for grounding natural language queries.
  arXiv  Detail & Related papers  (2024-07-16T05:44:30Z)
• Faithful Differentiable Reasoning with Reshuffled Region-based Embeddings [62.93577376960498]
  Knowledge graph embedding methods learn geometric representations of entities and relations to predict plausible missing knowledge.<n>We propose RESHUFFLE, a model based on ordering constraints that can faithfully capture a much larger class of rule bases.<n>The entity embeddings in our framework can be learned by a Graph Neural Network (GNN), which effectively acts as a differentiable rule base.
  arXiv  Detail & Related papers  (2024-06-13T18:37:24Z)
• Neuro-Symbolic Temporal Point Processes [13.72758658973969]
  We introduce a neural-symbolic rule induction framework within the temporal point process model. The negative log-likelihood is the loss that guides the learning, where the explanatory logic rules and their weights are learned end-to-end. Our approach showcases notable efficiency and accuracy across synthetic and real datasets.
  arXiv  Detail & Related papers  (2024-06-06T09:52:56Z)
• Probabilistic Truly Unordered Rule Sets [4.169915659794567]
  We propose TURS, for Truly Unordered Rule Sets. We exploit the probabilistic properties of our rule sets, with the intuition of only allowing rules to overlap if they have similar probabilistic outputs. We benchmark against a wide range of rule-based methods and demonstrate that our method learns rule sets that have lower model complexity and highly competitive predictive performance.
  arXiv  Detail & Related papers  (2024-01-18T12:03:19Z)
• Conjunct Resolution in the Face of Verbal Omissions [51.220650412095665]
  We propose a conjunct resolution task that operates directly on the text and makes use of a split-and-rephrase paradigm in order to recover the missing elements in the coordination structure. We curate a large dataset, containing over 10K examples of naturally-occurring verbal omissions with crowd-sourced annotations. We train various neural baselines for this task, and show that while our best method obtains decent performance, it leaves ample space for improvement.
  arXiv  Detail & Related papers  (2023-05-26T08:44:02Z)
• RulE: Knowledge Graph Reasoning with Rule Embedding [69.31451649090661]
  We propose a principled framework called textbfRulE (stands for Rule Embedding) to leverage logical rules to enhance KG reasoning. RulE learns rule embeddings from existing triplets and first-order rules by jointly representing textbfentities, textbfrelations and textbflogical rules in a unified embedding space. Results on multiple benchmarks reveal that our model outperforms the majority of existing embedding-based and rule-based approaches.
  arXiv  Detail & Related papers  (2022-10-24T06:47:13Z)
• LPRules: Rule Induction in Knowledge Graphs Using Linear Programming [4.94950858749529]
  Rule-based methods learn first-order logic rules that capture existing facts in an input graph and then use these rules for reasoning about missing facts. A major drawback of such methods is the lack of scalability to large datasets. We present a simple linear programming (LP) model to choose rules from a list of candidate rules and assign weights to them.
  arXiv  Detail & Related papers  (2021-10-15T17:58:16Z)
• Discovering Useful Compact Sets of Sequential Rules in a Long Sequence [57.684967309375274]
  COSSU is an algorithm to mine small and meaningful sets of sequential rules. We show that COSSU can successfully retrieve relevant sets of closed sequential rules from a long sequence.
  arXiv  Detail & Related papers  (2021-09-15T18:25:18Z)
• Parallelisable Existential Rules: a Story of Pieces [2.20439695290991]
  We introduce parallelisable sets of existential rules, for which the chase can be computed in a single breadth-first step from any instance. We show that parallelisable rule sets are exactly those rule sets both bounded for the chase and belonging to a novel class of rules, called pieceful.
  arXiv  Detail & Related papers  (2021-07-13T13:09:14Z)
• Recursive Rules with Aggregation: A Simple Unified Semantics [0.6662800021628273]
  This paper describes a unified semantics for recursion with aggregation. We present a formal definition of the semantics, prove important properties of the semantics, and compare with prior semantics. We show that our semantics is simple and matches the desired results in all cases.
  arXiv  Detail & Related papers  (2020-07-26T04:42:44Z)
• An Integer Linear Programming Framework for Mining Constraints from Data [81.60135973848125]
  We present a general framework for mining constraints from data. In particular, we consider the inference in structured output prediction as an integer linear programming (ILP) problem. We show that our approach can learn to solve 9x9 Sudoku puzzles and minimal spanning tree problems from examples without providing the underlying rules.
  arXiv  Detail & Related papers  (2020-06-18T20:09:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.