Mining conjunctive sequential patterns

info:eu-repo/semantics/publishe

Mining conjunctive sequential patterns: Extended Abstract

info:eu-repo/semantics/publishe

Utility-driven anonymization in data publishing

10.1145/2063576.2063945International Conference on Information and Knowledge Management, Proceedings2277-228

ρ-uncertainty: Inferenceproof transaction anonymization

Proceedings of the VLDB Endowment311033-104

Distributed privacy preserving data collection

10.1007/978-3-642-20149-3_9Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)6587 LNCSPART 193-10

Anonymizing set-valued data by nonreciprocal recoding

10.1145/2339530.2339696Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining1050-105

Mining conjunctive sequential patterns (Extended abstract)

In this paper we study the discovery of frequent sequences and we aim at extending the non-derivable condensed representation in frequent itemset mining to sequential pattern mining. We start by showing a negative example: in the context of frequent sequences, the notion of non-derivability is meaningless. This negative result motivated us to look at a slightly different problem: the mining of conjunctions of sequential patterns. This extended class of patterns turns out to have much nicer mathematical properties. For example, for this class of patterns we are able to extend the notion of non-derivable itemsets in a non-trivial way, based on a new unexploited theoretical definition of equivalence classes for sequential patterns. As a side-effect of considering conjunctions of sequences as the pattern type, we can easily form association rules between sequences. We believe that building a theoretical framework and an efficient approach for sequence association rules extraction problem is the first step toward the generalization of association rules to all complex and ordered patterns. This is an extended abstract of an article published in the Data Mining and Knowledge Discovery journal [1