关键词: 数据质量, 概率后缀树, 间隔约束

Abstract: Sequential data, which widely exists in real world applications, is an important research topic in data mining. The reliability of the mining results depends on the quality of sequences. Traditional data quality evaluation methods analyze the data quality problem by statistical indicator, but the statistical indicator can?t evaluate the relationship of each element in the unstructured sequence. To detect the quality of a sequence, this paper proposes a quality evaluation algorithm for sequential data using the probability suffix tree. Specifically, under the specified gap constraint, a probability suffix tree is built based on the sequences with reliable quality. Then, the tree is used for evaluating the quality of a query sequence. Finally, experiments on real-world sequence sets confirm the effectiveness, efficiency and scalability of the proposed algorithm.

Key words: data quality, probabilistic suffix tree, gap constraint