Mining sequences for patterns with non-repeating symbols

摘要: Finding the case id in unlabeled event logs is arguably one of hardest challenges process mining research. While this problem can be addressed with greedy approaches, these usually converge to sub-optimal solutions. In paper, we describe an approach perform complete search over space. We formulate as a matter finding minimal set patterns contained sequence, where interleaved but do not have repeating symbols. show that for practical purposes it possible reduce space maximal disjoint occurrences patterns. Experimental results suggest that, whenever finds solution, one.