Mining dependent frequent serial episodes from uncertain sequence data

Publication Type:
Conference Proceeding
Citation:
Proceedings - IEEE International Conference on Data Mining, ICDM, 2013, pp. 1211 - 1216
Issue Date:
2013-12-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013002361OK.pdf286.87 kB
Adobe PDF
In this paper, we focus on the problem of mining Probabilistic Dependent Frequent Serial Episodes (P-DFSEs) from uncertain sequence data. By observing that the frequentness probability of an episode in an uncertain sequence is a Markov Chain imbeddable variable, we first propose an Embeded Markov Chain-based algorithm that efficiently computes the frequentness probability of an episode by projecting the probability space into a set of limited partitions. To further improve the computation efficiency, we devise an optimized approach that prunes candidate episodes early by estimating the upper bound of their frequentness probabilities. © 2013 IEEE.
Please use this identifier to cite or link to this item: