CRoM and HuspExt Improving efficiency of high utility sequential pattern extraction

2016-05-10
Kirmemis Alkan, Öznur
Karagöz, Pınar
This paper presents efficient data structures and a pruning technique in order to improve the efficiency of high utility sequential pattern mining. CRoM (Cumulated Rest of Match) based upper bound, which is a tight upper bound on the utility of the candidates is proposed in order to perform more conservative pruning before candidate pattern generation in comparison to the existing techniques. In addition, an efficient algorithm, HuspExt (High Utility Sequential Pattern Extraction), is presented which calculates the utilities of the child patterns based on that of the parents'. Substantial experiments on both synthetic and real datasets from different domains show that, the solution efficiently discovers high utility sequential patterns under low thresholds.
Citation Formats
Ö. Kirmemis Alkan and P. Karagöz, “CRoM and HuspExt Improving efficiency of high utility sequential pattern extraction,” presented at the ICDE 2016, 2016, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/71143.