Mining closed partially ordered patterns, a new optimized algorithm

Abstract : Nowadays, sequence databases are available in several domains with increasing sizes. Exploring such databases with new pattern mining approaches involving new data structures is thus important. This paper investigates this data mining challenge by presenting OrderSpan, an algorithm that is able to extract a set of closed partially ordered patterns from a sequence database. It combines well-known properties of prefixes and suffixes. Furthermore, we extend OrderSpan by adapting efficient optimizations used in sequential pattern mining domain. Indeed, the proposed method is flexible and follows the sequential pattern paradigm. It is more efficient in the search space exploration, as it skips redundant branches. Experiments were performed on different real datasets to show (1) the effectiveness of the optimized approach and (2) the benefit of closed partially ordered patterns with respect to closed sequential patterns.
Type de document :
Article dans une revue
Knowledge-Based Systems, Elsevier, 2015, 79, pp.68 - 79. 〈10.1016/j.knosys.2014.12.027〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01144020
Contributeur : Florence Le Ber <>
Soumis le : lundi 20 avril 2015 - 16:28:19
Dernière modification le : jeudi 24 mai 2018 - 15:59:25

Identifiants

Citation

Mickaël Fabrègue, Agnès Braud, Sandra Bringay, Florence Le Ber, Maguelonne Teisseire. Mining closed partially ordered patterns, a new optimized algorithm. Knowledge-Based Systems, Elsevier, 2015, 79, pp.68 - 79. 〈10.1016/j.knosys.2014.12.027〉. 〈hal-01144020〉

Partager

Métriques

Consultations de la notice

351