Discovering Useful Compact Sets of Sequential Rules in a Long Sequence - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Discovering Useful Compact Sets of Sequential Rules in a Long Sequence

Abstract

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.
Fichier principal
Vignette du fichier
ICTAI2021b.pdf (245.46 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03494520 , version 1 (19-12-2021)

Identifiers

  • HAL Id : hal-03494520 , version 1

Cite

Erwan Bourrand, Luis Galárraga, Esther Galbrun, Elisa Fromont, Alexandre Termier. Discovering Useful Compact Sets of Sequential Rules in a Long Sequence. ICTAI 2021 - 33rd IEEE International Conference on Tools with Artificial Intelligence, Nov 2021, Virtual, United States. pp.1-5. ⟨hal-03494520⟩
46 View
47 Download

Share

Gmail Mastodon Facebook X LinkedIn More