Abstract. In this paper, an efficient strategy for mining top-K non-trivial faulttolerant repeating patterns (FT-RPs in short) with lengths no less than min_len from data sequences...
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Protein data contain discriminative patterns that can be used in many beneficial applications if they are defined correctly. In this work sequential pattern mining (SPM) is utiliz...
Themis P. Exarchos, Costas Papaloukas, Christos La...