In this paper, we introduce a weak representation as sets for pattern mining problems which extends the RAS class to a wider and significantly larger class of ...
In this paper, we introduce a weak representation as sets for pattern mining problems which extends the RAS class to a wider and significantly larger class of ...
In this paper, we introduce a \emph{weak representation as sets} for pattern mining problems which extends the \RAS\ class to a wider and significantly larger ...
In this paper, we introduce a weak representation as sets for pattern mining problems which extends the RAS class to a wider and sig-nificantly larger class of ...
⇒The coding f guarantees the comparability of patterns, i.e. θ ϕ ⇒ f(θ) Ç f(ϕ). Let us consider the following coding f of sequences into sets: for each letter x ...
From these results, we study how they can be applied to maximal pattern mining problems. We deduce a new classification of pattern mining problems and we point ...
[PDF] Extended dualization: Application to maximal pattern mining ...
www.semanticscholar.org › paper
A weak representation as sets for pattern mining problems is introduced which extends the RAS class to a wider and significantly larger class of problems, ...
The objective of this paper is to study reductions of the dualization problem on arbitrary posets to the dualization problem on boolean lattices, for which ...
Missing: Set- based
The dualization problem on arbitrary posets is a crucial step in many applications in logics, databases, artificial intelligence and pattern mining. The ...
Nov 17, 2016 · Abstract. The dualization in arbitrary posets is a well-studied problem in combinato- rial enumeration and is a crucial step in many ...