In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting sequen...
Sandra de Amo, Daniel A. Furtado, Arnaud Giacomett...
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior o...
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...