Mining Frequent Partite Episodes with Partwise Constraints


In this paper, we study the problem of efficiently mining frequent partite episodes that satisfy partwise constraints from an input event sequence. Through our constraints, we can extract episodes related to events and their precedent-subsequent relations, on which we focus, in a short time. This improves the efficiency of data mining using trial and error… (More)
DOI: 10.1007/978-3-319-08407-7_8

6 Figures and Tables


  • Presentations referencing similar topics