Constrained-Based Closed Pattern Mining in n-ary Relations
Résumé
Many complete and efficient algorithms for frequent closed set mining are now available. Generalizing such a task to n-ary relations may be important for many applications, e.g., when adding the time dimension to the popular objects X features binary case. The generality of the task - no assumption being made on the relation arity or on the size of its attribute domains - makes it computationally challenging. From a n-ary relation, our algorithm extracts all closed n-sets satisfying given piecewise (anti)-monotonic constraints.