Discovering Useful Compact Sets of Sequential Rules in a Long Sequence

09/15/2021
by   Erwan Bourrand, et al.
0

We are interested in understanding the underlying generation process for long sequences of symbolic events. To do so, we propose COSSU, an algorithm to mine small and meaningful sets of sequential rules. The rules are selected using an MDL-inspired criterion that favors compactness and relies on a novel rule-based encoding scheme for sequences. Our evaluation shows that COSSU can successfully retrieve relevant sets of closed sequential rules from a long sequence. Such rules constitute an interpretable model that exhibits competitive accuracy for the tasks of next-element prediction and classification.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2023

Neural-based classification rule learning for sequential data

Discovering interpretable patterns for classification of sequential data...
research
12/20/2022

MDL-based Compressing Sequential Rules

Nowadays, with the rapid development of the Internet, the era of big dat...
research
08/30/2018

Rule-based OWL Modeling with ROWLTab Protege Plugin

It has been argued that it is much easier to convey logical statements u...
research
07/13/2020

Predicting Sequences of Traversed Nodes in Graphs using Network Models with Multiple Higher Orders

We propose a novel sequence prediction method for sequential data captur...
research
05/02/2023

Ties in Multiwinner Approval Voting

We study the complexity of deciding whether there is a tie in a given ap...
research
02/19/2021

SEPAL: Towards a Large-scale Analysis of SEAndroid Policy Customization

To investigate the status quo of SEAndroid policy customization, we prop...
research
08/23/2019

Preventing the Generation of Inconsistent Sets of Classification Rules

In recent years, the interest in interpretable classification models has...

Please sign up or login with your details

Forgot password? Click here to reset