A parameterizable enumeration algorithm for sequence mining

In this paper, we introduce an generic framework for the mining of sequences under various constraints. More precisely, we study the enumeration of all partitions of a word w into multisets of subsequences. We show that using additional predicates, this generator can be used for frequent subsequence...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 468; S. 59 - 68
Hauptverfasser: David, J., Nourine, L.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 14.01.2013
Elsevier
Schlagworte:
Computer Science
Data Structures and Algorithms
Discrete Mathematics
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we introduce an generic framework for the mining of sequences under various constraints. More precisely, we study the enumeration of all partitions of a word w into multisets of subsequences. We show that using additional predicates, this generator can be used for frequent subsequences and substrings mining. We define the transition graph Tw whose vertices are multisets of words and arcs are transitions between multisets. We show that Tw is a directed acyclic graph and it admits a covering tree. We use Tw to propose a generic algorithm that enumerates all multisets that satisfies a set of predicates, without redundancy.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2012.11.005